Proof of solution of Problem 700B connecting universities? - Codeforces

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
41:32:08
Register now »

→ Streams

CF Edu Round 173 Solution Discussion

By aryanc403

Before stream 43:42:07

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	luogu_official	150

View all →

→ Find user

→ Recent actions

Detailed →

Proof of solution of Problem 700B connecting universities?

Revision en3, by spirited_away_, 2019-08-30 03:05:56

Here is the problem. 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.

History

Revisions

	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)