| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Regarding the time complexity of ABC 277 Ladder Takahashi
Good evening all,
The editorial for ABC 277 C — Ladder Takahashi states that the time complexity for aforementioned problem is O(N * log (N)).
Where is this logarithmic factor coming from ? Is this from the set and map data structures which take logarithmic time for insertion and search operation ? Would the time complexity reduce O(N) on average if we were to use an unordered_map or unordered_set ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Girus | 2022-11-15 08:15:17 | 3 | Tiny change: 'ty reduce O(N) on a' -> 'ty reduce to O(N) on a' | |
| en3 |
|
Girus | 2022-11-15 08:14:55 | 4 | Tiny change: 'exity for aforement' -> 'exity for the aforement' | |
| en2 |
|
Girus | 2022-11-15 08:14:34 | 94 | ||
| en1 |
|
Girus | 2022-11-15 08:13:59 | 524 | Initial revision (published) |
