Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 802 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) | FINISHED | False | 16200 | 280446923 | May 28, 2017, 8:05 a.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 1292 ) | M3 | April Fools' Problem (hard) | PROGRAMMING | binary search data structures flows | 2900 |
The plans for HC 2 are rather far-fetched: we are just over 500 000 days away from HC 2 3387, for example, and accordingly we are planning to have a couple hundred thousand problems in that edition (we hope that programming contests will become wildly more popular). The marmots need to get to work, and they could use a good plan... Same as the medium version, but the limits have changed: 1 ≤ k ≤ n ≤ 500 000 . Same as the medium version. |
| helvetic-coding-contest-2017-editorial.pdf |
No solutions yet.