| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
this submission using priority_queue is giving TLE : http://mirror.codeforces.com/contest/467/submission/43003735
where using set giving AC : http://mirror.codeforces.com/contest/467/submission/43003953
problem link: http://mirror.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.