| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
this submission using priority_queue is giving TLE : http://codeforces.com/contest/467/submission/43003735
where using set giving AC : http://codeforces.com/contest/467/submission/43003953
problem link: http://codeforces.com/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.