| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
TLE from unordered_set C++
Hello Codeforces community!
I have a question regarding question B in the recent CodeTon round.
My solution passed all pretests, but TLE on test 22 in the main tests. My code is: 150736681
I used an unordered_set to keep tracking of the seen elements. However, when I changed it to set, the solution passed main tests too. I have always thought that unordered_set are faster than set. Can someone please explain to me what's happening here?
Thanks for any help!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
haochenkang | 2022-03-24 21:39:30 | 5 | Tiny change: 'ered_set` are faster th' -> 'ered_set` is faster th' | |
| en5 |
|
haochenkang | 2022-03-24 21:28:06 | 0 | (published) | |
| en4 |
|
haochenkang | 2022-03-24 21:27:46 | 0 | ||
| en3 |
|
haochenkang | 2022-03-24 21:27:45 | 373 | (saved to drafts) | |
| en2 |
|
haochenkang | 2022-03-24 21:26:03 | 10 | Tiny change: 'n \n}\n~~~~~\n\nI used' -> 'n \n}\n\n\nI used' | |
| en1 |
|
haochenkang | 2022-03-24 21:25:01 | 935 | Initial revision (published) |
