bzoj1648

还是金组的水题看见就一起做了。。。

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<queue>using namespace std;int n,m,k,cow[109],map[1009][1009]={0},done[1009];void bfs(int x){int f[1009]={0};queue<int>q;q.push(x);f[x]=1;while(!q.empty()){int now=q.front();done[now]++;q.pop();for(int i=1;i<=n;i++)if(map[now][i]&&!f[i]){f[i]=1;q.push(i);}}return;}int main(){scanf("%d%d%d",&k,&n,&m);for(int i=1;i<=k;i++){int t;scanf("%d",&t);cow[i]=t;}for(int i=1;i<=m;i++){int a1,a2;scanf("%d%d",&a1,&a2);map[a1][a2]=1;}memset(done,0,sizeof(done));for(int i=1;i<=k;i++)bfs(cow[i]);int ans=0;for(int i=1;i<=n;i++)if(done[i]>=k)ans++;printf("%d\n",ans);return 0;}