| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
this submission using priority_queue is giving TLE : http://codeforces.net/contest/467/submission/43003735
where using set giving AC : http://codeforces.net/contest/467/submission/43003953
problem link: http://codeforces.net/contest/467/problem/D
could anyone point me out what is wrong here! i am literally not getting the point :(
I think you need to check whether not-unique items being inserting into container or not.
set keeps only unique items. priorityqueue doesn't. Therefore you can execute for-loop inside while-loop too many extra times and get TLE.
yes, thank you for pointing it out.
it is giving time limit for this 'non-unique' pushing.
if the edges are like:
1-x
2-x
...
...
...
n-x
then x will be pushed n times in the queue,which will lead the complexity to O(n^2).
it is sad that i have missed the point.
again thank you for pointing this.