[HackerEarth] You have a tree T (an undirected connected graph containing no cycles) of N nodes rooted at node number 1. Each node is painted either White or Black . You intend to gift this tree to yo - 题解

暂无题解

题目信息
题号 P20469
标题 [HackerEarth] You have a tree T (an undirected connected graph containing no cycles) of N nodes rooted at node number 1. Each node is painted either White or Black . You intend to gift this tree to yo
难度 普及-
返回题目