Can anyone give me more detail proof of why the answer to the problem is always summation of min(S[v], 2*k - S[v]).
The editorial is not clear.
# | 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 | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
Proof of solution of Problem 700B connecting universities?
Can anyone give me more detail proof of why the answer to the problem is always summation of min(S[v], 2*k - S[v]).
The editorial is not clear.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
spirited_away_ | 2019-08-30 03:05:56 | 68 | ||
en2 |
![]() |
spirited_away_ | 2019-08-30 03:05:01 | 2 | ||
en1 |
![]() |
spirited_away_ | 2019-08-30 03:04:45 | 249 | Initial revision (published) |
Name |
---|