Score : 400 points
We have a tree with N vertices numbered 1 to N. The i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i. Your objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:
Find a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.
Input is given from Standard Input in the following format:
N u_1 v_1 w_1 u_2 v_2 w_2 . . . u_{N - 1} v_{N - 1} w_{N - 1}
Print a coloring of the vertices that satisfies the condition, in N lines.
The i-th line should contain 0
if Vertex i is painted white and 1
if it is painted black.
If there are multiple colorings that satisfy the condition, any of them will be accepted.
3 1 2 2 2 3 1
0 0 1
5 2 5 2 2 3 10 1 3 8 3 4 2
1 0 1 0 1