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
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <stack>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct edge {
int to, cap, rev;
edge(int t, int c, int r) {
to = t; cap = c; rev = r;
}
};
vector<edge> G[105];
bool used[105];
void add_edge(int from,int to,int cap) {
G[from].push_back(edge(to,cap,G[to].size()));
G[to].push_back(edge(from,0,G[from].size()-1));
}
int dfs(int v,int t,int f) {
if(v == t) return f;
used[v] = true;
rep(i,G[v].size()) {
edge &e = G[v][i];
if(!used[e.to] && e.cap > 0) {
int d = dfs(e.to,t,min(f,e.cap));
if(d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s,int t) {
int flow = 0;
for(;;) {
memset(used,0,sizeof(used));
int f = dfs(s,t,INF);
if(f == 0) return flow;
flow += f;
}
}
int main() {
int n, g, e;
cin >> n >> g >> e;
vector<int> p(g);
rep(i, g) cin >> p[i];
rep(i, e) {
int a, b;
cin >> a >> b;
add_edge(a, b, 1);
add_edge(b, a, 1);
}
rep(i, g) {
add_edge(p[i], n+1, 1);
}
int s = 0, t = n + 1;
cout << max_flow(s, t) << endl;
return 0;
}
|