The title states the problem — source. Constraints $$$N <= 25e4$$$
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Direct edges of a tree to maximise pairs of reachable nodes
The title states the problem — source. Constraints $$$N <= 25e4$$$
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | infinitepro | 2021-04-01 08:46:16 | 5 | Tiny change: 'raints $N <= 25e4$' -> 'raints $N \le 25e4$' | ||
en1 | infinitepro | 2021-04-01 08:43:11 | 208 | Initial revision (published) |
Название |
---|