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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define REP(i,e,s) for(register int i=(e); i<=(s); i++)
#define DREP(i,e,s) for(register int i=(e); i>=(s); i--)
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define file(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout)
#define ll long long
int read() {
int x=0,f=1,ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int MAXN=1000+10,MAXM=100000+10;
int head[MAXN],_next[MAXM],to[MAXM],cnt;
void addedge(int u,int v) {
cnt++;
_next[cnt]=head[u];
head[u]=cnt;
to[cnt]=v;
}
vector<int> g[MAXN];
int book[MAXN],flag[MAXN],mark[MAXN];
queue<int> q;
void bfs(int s) {
q.push(s);
while(!q.empty()) {
int u=q.front();q.pop();
REP(i,0,(int)g[u].size()-1) {
int v=g[u][i];
if(flag[v]) continue;
flag[v]=1;
q.push(v);
}
}
}
int in[MAXN];
void bfs2(int s) {
q.push(s);mark[s]=1;
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=head[u]; i; i=_next[i]) {
int v=to[i];
if(mark[v]) continue;
mark[v]=1;
q.push(v);
}
}
}
int ans[MAXN];
int main() {
int n=read(),m=read(),d=read();
REP(i,1,m) {
int u=read(),v=read();
addedge(u,v);in[v]++;
g[v].push_back(u);
}
REP(i,1,d) book[read()]=1;
REP(i,1,n) {
memset(flag,0,sizeof(flag));
memset(mark,0,sizeof(flag));
bfs(i);
REP(j,1,n)
if(!flag[j]&&in[j]==0&&j!=i) bfs2(j);
REP(j,1,n) {
if(!mark[j]&&book[j]) {
ans[i]=1;
break;
}
}
}
REP(i,1,n) if(ans[i]) printf("%d ",i);
return 0;
}
|
