给你一棵树 (结点个数为 $ n(n \le 10^5) $, 现在需要将树上所有结点染成白色或黑色, 打印一种可行的方案(将 $ i $ 号点染成白色则输出
0
, 否则, 输出1
), 满足:同一种颜色的点之间的距离是偶数。
思路:
- Beginner 性质 思维 AtCoder Contestbeginner性质 思维atcoder beginner思维atcoder contest contest programming beginner atcoder beginner atcoder contest 296 beginner atcoder contest 295 beginner atcoder contest abcde beginner atcoder contest 335 beginner atcoder contest 334 beginner atcoder contest 332 beginner atcoder contest 328