GOT - Gao on a tree
There's a tree, with each vertex assigned a number. For each query (a, b, c), you are asked whether there is a vertex on the path from a to b, which is assigned number c?
There are multiple cases, end by EOF.
For each case, the first line contains n (n <= 100000) and m (m <= 200000), representing the number of vertexes (numbered from 1 to n) and the number of queries.
Then n integers follows, representing the number assigned to the i-th vertex.
Then n-1 lines, each of which contains a edge of the tree.
Then m lines, each of which contains three integers a, b and c (0 <= c <= n), representing a query.
You should output "
Find" or "
NotFind" for every query on one line.
Output a blank line AFTER every case.
Input: 5 5 1 2 3 4 5 1 2 1 3 3 4 3 5 2 3 4 2 4 3 2 4 5 4 5 1 4 5 3 Output: NotFind Find NotFind NotFind Find
C++14 Clang 4.0 is OK with DFS-recursion.
Last edit: 2017-03-15 10:45:37
Be careful! Got AC with C++ 4.0.0-8 and for some reason the same code compiled with C++ 4.3.2 gave me SIGSEGV! I think it has to do with the maximum stack size, as I am using recursion...
Hussain Kara Fallah:
for who solved this problem
I used b) per test case. Hopefully exact judge isn't used and that's not a problem.
What does "Output a blank line AFTER every case." mean in this case?
Buda IM (retired):
Then n integers follows, representing the number assigned to the ith vertex.!!
I'm sorry for my mistake..The dataset has the testcase number T, and i have deleted it and all submit has rejudged.
getting SIGFPE on assertion "first vertex of edge" > n