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 |
|---|---|---|---|---|---|---|
| ( 1336 ) | A2 | Heidi and Library (medium) | PROGRAMMING | data structures greedy | 1800 |
Whereas humans nowadays read fewer and fewer books on paper, book readership among marmots has surged. Heidi has expanded the library and is now serving longer request sequences. Same as the easy version, but the limits have changed: 1 ≤ n , k ≤ 400 000 . Same as the easy version. |
| helvetic-coding-contest-2017-editorial.pdf |
No solutions yet.