| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3885 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3580 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3506 |
| 7 | ecnerwala | 3505 |
| 8 | Radewoosh | 3457 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | -is-this-fft- | 161 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 154 |
| 8 | luogu_official | 153 |
| 9 | awoo | 152 |
| 10 | maomao90 | 150 |
POJ-1987 Help
Hi everyone, I was trying to solve this problem. You can find my code here. My complexity is $$$O(N \cdot log^2(N))$$$.
However, I am getting TLE. Can someone please help in optimizing my code? I have written appropriate comments in the DFS function. For LCA and Centroid Decomposition, I referred to this blog and took the code from here.
Please help.
