| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | nor | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | atcoder_official | 147 |
| 7 | TheScrasse | 147 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
compressed trees
i was reading the tutorial for problem E from this round https://codeforces.com/blog/entry/125943
and it says that "And as it is known, the number of edges in the compressed tree is O(k)"
i couldnt find anything about it on the internet does anyone have a proof on why we have O(k) edges in a compressed tree ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Axial-Tilted | 2024-03-30 06:59:18 | 284 | ||
| en1 |
|
Axial-Tilted | 2024-03-30 06:50:18 | 333 | Initial revision (published) |
