-
Notifications
You must be signed in to change notification settings - Fork 0
/
hop_mat.cpp
52 lines (49 loc) · 969 Bytes
/
hop_mat.cpp
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
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int k, n ,m;
vector<int> adj[1002];
int a[1001];
bool visited[1002];
map<ll,ll> mp;
void inp(){
cin >> k >> n >> m;
memset(adj, 0, sizeof(adj));
memset(a,0, sizeof(a));
mp.clear();
for(int i = 1; i <= k; i++){
cin >> a[i];
}
for(int i = 0; i < m; i++){
int x,y; cin >> x >> y;
adj[x].push_back(y);
}
}
void DFS(int u){
mp[u]++;
visited[u] = true;
for(int v : adj[u]){
if(!visited[v]){
DFS(v);
}
}
}
void solve(){
int ans = 0;
for(int i = 1; i <= k; i++){
memset(visited, 0, sizeof(visited));
DFS(a[i]);
}
for(int i = 1; i <= n; i++){
if(mp[i] == k){
// cout<<i<<endl;
ans++;
}
// cout<<mp[a[i]]<<endl;
}
cout<<ans<<endl;
}
int main(){
inp();
solve();
}