BTCODE_G - Coloring Trees
Nivash and Bhoopathi play a game of memory, which goes as follows: There is a tree containing 'N' nodes, all of which are initially uncoloured. In the game, Nivash has 2 moves:
1) Command: Color a particular node with a given color.
2) Query: Ask Bhoopathi if the path from node 'a' to node 'b' (both inclusive), is monochromatic or not.(i.e Whether all nodes on the path have the same color).
Nivash can do these steps in any order he wishes and he colors each node atmost once. Whenever Nivash puts forth a 'Query' at Bhoopathi, Bhoopathi has to recollect the colouring of the tree and reply either "YES" or "NO". Can your help Bhoopathi answer these queries?
The first line of input contains an integer 'N', denoting the number of nodes in the tree. The next 'N-1' lines contain 2 space separated integers 'u' and 'v', denoting an edge between vertex 'u' and vertex 'v'.
The next line contains an integer 'Q', denoting the number of inputs (commands and queries) which Nivash wants to give. The next 'Q' lines contain 3 space separated integers 'x', 'a', 'b'. If 'x' is 1, it denotes a command to color node 'a' with a color 'b'. If 'x' is 2, it denotes a query and Bhoopathi should answer if the path from node 'a' to node 'b' (both inclusive), is monochromatic or not.
All vertices of the tree are 0 based.
For each query, output "YES" or "NO" (quotes for clarity), denoting whether the path from node 'a' to node 'b' (both inclusive), is monochromatic or not.
Output "NO", even if all nodes on the path from node 'a' to node 'b' (both inclusive) are uncolored.
Input: 3 0 1 1 2 7 1 0 11 2 0 1 2 0 2 1 2 12 1 1 11 2 0 1 2 0 2 Output: NO NO YES NO Constraints: 1 <= N <= 100000 1 <= Q <= 200000 1 <= color value <= 30.
Initially node '0' is colored with color '11', so path between node '0' and node '1' is not monochromatic. Hence, the answer is "NO". The same explanation holds for the path between node '0' and node '2'. Then node '2' is colored with color '12' and node '1' with color '11'. Now, all nodes on the path between node '0' and node '1' are colored with only one color ('11'), so the answer is "YES". The path between node '0' and node '2' has 2 colors ('11' and '12'), hence the answer is "NO".
"he colors each node atmost once". I have no idea how I missed this
VISHAL DEEPAK AWATHARE:
can we expect theLast edit: 2015-01-30 06:08:39
Seems like test cases are not that strong. I was using 1 based tree indexing, but still it got passed. Quite surprised.
does v always equals to u+1 ,or its only on this test case
Nope! If all nodes on a path are uncolored, output "NO"!
Is "uncolour" also regarded as colour?