Ancestors in Two Trees
All submissions for this problem are available.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.
You are given two rooted trees, each with N nodes. The nodes in each tree are labeled from 1 to N. The root of each tree is the node labeled 1 in that tree.
Your task is simple: For each i, find the number of j's (j ≠ i), such that node j is an ancestor of node i in both the trees.
- The first line of the input contains an integer T denoting the number of test cases.
- First line of each test-case contains N, the number of nodes in each tree.
- The i-th of the next N - 1 lines contains two integers, ui and vi, which denotes that there is an edge between node ui and node vi in the first tree.
- The i-th of the next N - 1 lines contains two integers, ui and vi, which denotes that there is an edge between node ui and node vi in the second tree.
For each test case, output a single line containing N integers, i-th integer is the number of nodes which are ancestors of node i in both the trees.
- 1 ≤ T ≤ 10000
- 2 ≤ N ≤ 500,000
- 1 ≤ sum of N in all test-cases ≤ 500,000
- 1 ≤ ui, vi ≤ N
Input: 1 5 1 3 1 2 3 5 3 4 1 5 1 2 2 3 3 4 Output: 0 1 1 2 1
Because node 1 is the root in both the trees, there is no node above them. So first output is 0.
Node 1 is the only node which is an ancestor of Node 2 in both the trees. So the second output is 1.
Node 1 is the only node which is an ancestor of Node 3 in both the trees. So the third output is 1.
Node 1 and node 3 are the only nodes which are ancestors of Node 4 in both the trees. So the fourth output is 2.
Node 1 is the only node which is an ancestor of Node 5 in both the trees. So the fifth output is 1.
|Time Limit:||3 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.