| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
In this problem, we need to calculate the shortest path from an origin in a graph with up to $$$10^5$$$ nodes.
The real solution is using dijkstra and priority queue.
But some participants used spfa which can be $$$O(n^2)$$$ in some special datas Like this submission.
Our IOI aker PEIMUDA made two datas
1000000000000000000
24999 99999 25000
1000000000000000000
33332 99998 33333
The answers are
999999999687537499
999999999444505554
They can make the submisssion run up to 5 seconds.
The A&B&C three problems are not hard at all, but it still takes me 47 minutes to solve them.
The D&E&F three problems are really hard to solve.
It seems that from ranking 50 to ranking 900 are all contestants who solves three problems, it just depends on how fast they do it.
There are also past ARC's that contains easy A&B&C, but extremely hard D&E&F which, for me, are impossible to do.
