-
Notifications
You must be signed in to change notification settings - Fork 1
/
CV2E.cpp
67 lines (64 loc) · 1.47 KB
/
CV2E.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int common[55];
int visited[55];
vector <int> V[55];
void dfs(int v)
{
common[v]++;
visited[v]=1;
int Size=V[v].size();
for(int i=0;i<Size;i++)
if(!visited[ V[v][i]])
dfs(V[v][i]);
}
int main()
{
int n,m;
cin>>n>>m;
int depend[55]={0};
int i,u,v;
for(i=0;i<m;i++)
{
cin>>u>>v;
V[u].push_back(v);
V[v].push_back(u);
}
int Q;
cin>>Q;
for(i=0;i<Q;i++)
{
memset(visited,0,sizeof(visited));
cin>>v;
depend[v]=1;
dfs(v);
}
bool first=true;
vector <int> ans;
vector <int>::iterator it;
for(i=1;i<=n;i++)
{
if(!depend[i] && common[i]==Q)
{
ans.push_back(i);
}
//cout<<common[i]<<" ";
}
int Size=ans.size();
if(Size==0)
cout<<-1;
else
{
int x=0;
for(it=ans.begin();it!=ans.end();++it,x++)
{
if(x==Size-1)
cout<<*it;
else
cout<<*it<<" ";
}
}
//cin>>i;
return 0;
}