- 题目提供者 FarmerJohn2
- 评测方式 云端评测
- 标签 搜索 深度优先搜索,DFS 贪心 USACO 2006
- 难度 普及/提高-
- 时空限制 1000ms / 128MB
The cows are having a picnic! Each of Farmer John's K (1 ≤ K ≤ 100) cows is grazing in one of N (1 ≤ N ≤ 1,000) pastures, conveniently numbered 1...N. The pastures are connected by M (1 ≤ M ≤ 10,000) one-way paths (no path connects a pasture to itself).
The cows want to gather in the same pasture for their picnic, but (because of the one-way paths) some cows may only be able to get to some pastures. Help the cows out by figuring out how many pastures are reachable by all cows, and hence are possible picnic locations.
Line 1: Three space-separated integers, respectively: K, N, and M
Lines 2..K+1: Line i+1 contains a single integer (1..N) which is the number of the pasture in which cow i is grazing.
Lines K+2..M+K+1: Each line contains two space-separated integers, respectively A and B (both 1..N and A != B), representing a one-way path from pasture A to pasture B.输出格式：
Line 1: The single integer that is the number of pastures that are reachable by all cows via the one-way paths.
The cows can meet in pastures 3 or 4.