题目描述
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.
K(1≤K≤100)只奶牛分散在N(1≤N≤1000)个牧场．现在她们要集中起来进餐．牧场之间有M(1≤M≤10000)条有向路连接，而且不存在起点和终点相同的有向路．她们进餐的地点必须是所有奶牛都可到达的地方．那么，有多少这样的牧场呢？
输入输出格式
输入格式：
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.
输入输出样例
输入样例#1：
2 4 4 2 3 1 2 1 4 2 3 3 4
输出样例#1：
2
说明
The cows can meet in pastures 3 or 4.
以每一头牛为起点，DFS标记所有能到达的点。如果一个点被标记的次数等于牛总数，那么将它计入答案。
1 /*by SilverN*/
2 #include<iostream>
3 #include<algorithm>
4 #include<cstring>
5 #include<cstdio>
6 #include<cmath>
7 #include<vector>
8 using namespace std;
9 const int mxn=1010;
10 int read(){
11 int x=0,f=1;char ch=getchar();
12 while(ch<‘0‘ || ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
13 while(ch>=‘0‘ && ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
14 return x*f;
15 }
16 vector<int>e[mxn];
17 int cnt[mxn];
18 bool vis[mxn];
19 void DFS(int u){
20 vis[u]=1;
21 cnt[u]++;
22 for(int i=0;i<e[u].size();i++){
23 int v=e[u][i];
24 if(!vis[v]){
25 DFS(v);
26 }
27 }
28 return;
29 }
30 int K,n,m;
31 int cow[mxn];
32 int main(){
33 int i,j,u,v;
34 K=read();n=read();m=read();
35 for(i=1;i<=K;i++){
36 cow[i]=read();
37 }
38 for(i=1;i<=m;i++){
39 u=read();v=read();
40 e[u].push_back(v);
41 }
42 for(i=1;i<=K;i++){
43 memset(vis,0,sizeof vis);
44 DFS(cow[i]);
45 }
46 int ans=0;
47 for(i=1;i<=n;i++)
48 if(cnt[i]==K)ans++;
49 cout<<ans<<endl;
50 return 0;
51 }