# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
I am not familiar with Java but what you are using Hash table. A Hash table in worst case takes O(n) operation for search, delete and insertion(See Blowing Up Hash Tables). This happens when there are multiple chains(collisions) in the hash table(See Hash table chaining). I'd suggest to use Arrays and Vectors instead! Give me feedback if this helped or not!
https://codeforces.com/contest/1283/submission/69194098 — I replaced HashMap with TreeMap and got it Accepted
Wow that is great to hear that you fixed the issue!
But in Java,
HashMap<>
could be treeified so the worst case won't happen. FYIThe root cause, I guess, maybe
TreeMap<>
leads to an earlier break in the iteration?Anyway, to solve this problem,
Map
is not necessary. Just shuffle and check the array some times.