题目:http://www.lightoj.com/volume_showproblem.php?problem=1111
题意:有n个城市k个人,城市间有m条单向路,现在k个人想到集中到某一个城市,问这样的城市有多少个
思路:分别从k个人所在的城市进行一个bfs,记录每个城市被访问的次数,把访问到的城市均加1,最后被访问次数等于k的城市就是满足条件的
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
using namespace std;
const int N = 1010;
struct edge
{
int to, next;
}g[N*10];
bool vis[N];
int cnt, head[N];
int arr[N], num[N];
int cas;
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void bfs(int s)
{
memset(vis, 0, sizeof vis);
queue<int> que;
que.push(s), vis[s] = true, num[s]++;
while(! que.empty())
{
int v = que.front(); que.pop();
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(! vis[u])
que.push(u), vis[u] = true, num[u]++;
}
}
}
int main()
{
int t, k, n, m, a, b;
scanf("%d", &t);
while(t--)
{
cnt = 0;
memset(head, -1, sizeof head);
memset(num, 0, sizeof num);
scanf("%d%d%d", &k, &n, &m);
for(int i = 1; i <= k; i++) scanf("%d", &arr[i]);
for(int i = 1; i <= m; i++) scanf("%d%d", &a, &b), add_edge(a, b);
for(int i = 1; i <= k; i++) bfs(arr[i]);
int res = 0;
for(int i = 1; i <= n; i++) if(num[i] == k) res++;
printf("Case %d: %d\n", ++cas, res);
}
return 0;
}