AGC014E Blue and Red Tree
摘要:
题意 There is a tree with $N$ vertices numbered $1$ through $N$. The $i$ th of the $N−1$ edges connects vertices $a_i$ and $b_i$. Initially, each edge i 阅读全文
posted @ 2018-08-23 21:29 autoint 阅读(250) 评论(0) 推荐(0) 编辑