| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
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) |
