Doubt in 1889B (Codeforces Round 906 Div 1.)
Problem Statement: this Is there a way to prove that if we are not able to connect the vertices to 1 in the greedy order that has been suggested, then there exists no other answer?
Thanks.
Codeforces Round 945 Solution Discussion (with myself)
Atcoder ABC #354 Solution Discussion