CF1781G.Diverse Coloring
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
In this problem, we will be working with rooted binary trees. A tree is called a rooted binary tree if it has a fixed root and every vertex has at most two children.
Let's assign a color — white or blue — to each vertex of the tree, and call this assignment a coloring of the tree. Let's call a coloring diverse if every vertex has a neighbor (a parent or a child) colored into an opposite color compared to this vertex. It can be shown that any tree with at least two vertices allows a diverse coloring.
Let's define the disbalance of a coloring as the absolute value of the difference between the number of white vertices and the number of blue vertices.
Now to the problem. Initially, the tree consists of a single vertex with the number 1 which is its root. Then, for each i from 2 to n , a new vertex i appears in the tree, and it becomes a child of vertex pi . It is guaranteed that after each step the tree will keep being a binary tree rooted at vertex 1 , that is, each vertex will have at most two children.
After every new vertex is added, print the smallest value of disbalance over all possible diverse colorings of the current tree. Moreover, after adding the last vertex with the number n , also print a diverse coloring with the smallest possible disbalance as well.
输入格式
Each test contains multiple test cases. The first line contains the number of test cases t ( 1≤t≤104 ). The description of the test cases follows.
The first line of each test case contains a single integer n ( 2≤n≤2⋅105 ) — the number of vertices in the final tree.
The second line contains n−1 integers p2,p3,…,pn ( 1≤pi≤i−1 ) — the numbers of parents of vertices 2,3,…,n . No integer appears more than twice among p2,p3,…,pn .
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 .
输出格式
For each test case, print n−1 integers — the smallest value of disbalance over all possible diverse colorings of the tree after adding vertices 2,3,…,n .
Then print a string of n characters 'w' and 'b', describing a diverse coloring with the smallest possible disbalance for the whole tree after adding vertex n : the i -th character must be equal to 'w' if vertex i is colored white, and 'b' if it's colored blue. The absolute value of the difference between the numbers of 'w' and 'b' characters must be equal to the last printed integer. Each vertex must have a parent or a child colored into the color opposite to the vertex's color.
输入输出样例
输入#1
2 7 1 2 2 1 5 5 8 1 2 3 4 5 6 7
输出#1
0 1 2 1 0 1 wbwwwbb 0 1 0 1 0 1 0 wbwbwbwb
说明/提示
In the first test case, examples of diverse colorings with the smallest possible disbalances for all intermediate trees are illustrated below: