https://cses.fi/problemset/task/1139
https://cses.fi/paste/cdb7092742c2c314be200e/
DFS , TC: O(n)
m=2*n
Segment tree , build and query , O(mlogmlogm) , roughly
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
How can i improve this implementation , current gives TLE , is my TC calculation right ?
https://cses.fi/problemset/task/1139
https://cses.fi/paste/cdb7092742c2c314be200e/
DFS , TC: O(n)
m=2*n
Segment tree , build and query , O(mlogmlogm) , roughly
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
rickgrimes07 | 2025-03-26 23:24:30 | 86 | ||
| en1 |
|
rickgrimes07 | 2025-03-26 23:23:50 | 196 | Initial revision (published) |
| Название |
|---|


