#PU970. USACO 2019 December Contest, Gold — Problem 2. Milk Visits
USACO 2019 December Contest, Gold — Problem 2. Milk Visits
USACO 2019 December Contest, Gold — Problem 2. Milk Visits
题目描述
Farmer John is planning to build () farms that will be connected by roads, forming a tree (i.e., all farms are reachable from each-other, and there are no cycles). Each farm contains a cow with an integer type between and inclusive. Farmer John's friends () often come to visit him. During a visit with friend , Farmer John will walk with his friend along the unique path of roads from farm to farm (it may be the case that ). Additionally, they can try some milk from any cow along the path they walk. Since most of Farmer John's friends are also farmers, they have very strong preferences regarding milk. Each of his friends will only drink milk from a certain type of cow. Any of Farmer John's friends will only be happy if they can drink their preferred type of milk during their visit. Please determine whether each friend will be happy after visiting.
输入格式
The first line contains two integer and . The second line contains space-separated integers The type of the cow in the -th farm is denoted by The next lines each contain two distinct integers and (), indicating that there is an edge between farms and . The next lines contain integers , , and . and represent the endpoints of the path walked during friend 's visit, while () indicates the type of cow whose milk the friend enjoys drinking.
输出格式
Print a binary string of length The th character of the string should be '1' if the th friend will be happy, or '0' otherwise.
数据范围
Test case 2 is the second example case below. Test case 3 satisfies . Test cases 4-7 satisfy ( defined below).
样例
样例 1
5 5
1 1 2 1 2
1 2
2 3
2 4
1 5
1 4 1
1 4 2
1 3 2
1 3 1
5 5 1
10110
In this example, the path from 1 and 4 involves farms 1, 2, and 4. All of these
contain cows of type 1, so the first friend will be satisfied while the second
one will not.
样例 2
6 4
1 2 3 3 3 3
1 2
2 3
3 4
2 5
5 6
4 6 1
4 6 2
4 6 3
4 6 4
0110
Problem credits: Spencer Compton