problem : ANCESTOR
i actually thought about ->traversing down the both the trees parallely from root to leaves and binary lifting of the bfs/dfs array…
can anyone share his approach…?
Maybe this can help https://codeforces.com/blog/entry/52348?#comment-364157?
There are no editorials for this contest 
shit …i forgot to look for its invitation blog on cf …thanx buddy
1 Like
Do post soln if you get the answer. 