The title states the problem — source. Constraints $$$N \le 25e4$$$
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 163 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 158 |
6 | djm03178 | 154 |
7 | adamant | 153 |
8 | luogu_official | 148 |
8 | awoo | 148 |
10 | TheScrasse | 146 |
Direct edges of a tree to maximise pairs of reachable nodes
The title states the problem — source. Constraints $$$N \le 25e4$$$
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|