1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
| #include <bits/stdc++.h>
using namespace std;
const int LEN = 1e3 + 50;
int n, m, k, tot, ans, head[LEN], vis[LEN], cow[LEN], cnt[LEN];
struct edge {
int to_, nxt_;
} e[(int)1e5 + 50];
void add(int u, int v) {
e[tot].nxt_ = head[u], e[tot].to_ = v;
head[u] = tot++;
}
void dfs(int x) {
if (vis[x]) return;
vis[x] = 1;
++cnt[x];
for (int i = head[x]; ~i; i = e[i].nxt_) {
dfs(e[i].to_);
}
}
int main() {
int u, v;
cin >> k >> n >> m;
memset(head, -1, sizeof(head));
for (int i = 0; i < k; ++i) cin >> cow[i];
for (int i = 0; i < m; ++i) {
cin >> u >> v;
add(u, v);
}
for (int i = 0; i < k; ++i) {
memset(vis, 0, sizeof(vis));
dfs(cow[i]);
}
for (int i = 1; i <= n; ++i) {
if (cnt[i] == k) ++ans;
}
cout << ans;
return 0;
}
|