| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
So I tried problem G on the last div3 contest, my solution seems to work with small test case but then gave me an TLE with bigger test case
My submission : https://mirror.codeforces.com/contest/1941/submission/251046117
Problem's statement : https://mirror.codeforces.com/contest/1941/problem/G
UPD : sorry my dijkstra implementation was wrong :v
It's said that there are $$$2 \cdot 10^5$$$ vertexes, $$$2 \cdot 10^5$$$ edges and also $$$2 \cdot 10^5$$$ colors. Your code's time complexity at least is $$$O(NC)$$$ where $$$C$$$ is the count of colors.
And,
priority_queueis not necessary.I think that the second dimension of the map only contains the color of edges that can go to that vertex
No, I am Ac in contest but still TLE in test 47 after hacking 250934676, I think some one had rand a test anti prioryty_queue.
Auto comment: topic has been updated by Yen_Nhi (previous revision, new revision, compare).
As far as I see from the code, for each pair (vertex
v, colorc) you traverse all edges incident tov. So basically if there is a vertex with allmedges incident to it and all have different colors, you will do at leastO(m^2)operations, which is clear TLE.thank you for pointing that out