一道DFS的题目。刚开始纠结了很久怎么判断牧场满不满足条件,试着去枚举所有两头牛的组合。后来发现这样的复杂度太高,反过来思考问题的话顿时简单了很多。如果一个牧场有K头牛能到达的话即满足了题意。这样O(n)时间判断牧场就可以了。
另外因为是稀松图,采用邻接表储存的话会比较简单。DFS里面的下标容易搞混...需要注意
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
const int MAXN = 1005;
vector<int> a[MAXN];
int vis[MAXN], ans[MAXN], cow[MAXN];
int k, n, m;
void DFS(int index)
{
for (int i = 0; i < a[index].size(); i++)
{
if (!vis[a[index][i]])
{
ans[a[index][i]]++;
vis[a[index][i]] = 1;
DFS(a[index][i]);
}
}
}
int main()
{
while (scanf("%d%d%d", &k, &n, &m) != EOF)
{
memset(ans, 0, sizeof(ans));
for (int i = 1; i <= k; i++)
scanf("%d", &cow[i]);
for (int i = 0; i < m; i++)
{
int u, v;
scanf("%d%d", &u, &v);
a[u].push_back(v);
}
for (int i = 1; i <= k; i++)
{
memset(vis, 0, sizeof(vis));
vis[cow[i]] = 1;
ans[cow[i]]++;
DFS(cow[i]);
}
int count = 0;
for (int i = 1; i <= n; i++)
if (ans[i] == k)
count++;
printf("%d\n", count);
}
}