Submission #3631395

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n, g, e;
vector<int> p;
struct edge{
	int to, cap, rev;
};
vector<edge> G[105];
bool used[105];
int inf = 1e9+7;

void add_edge(int from, int to, int cap){
	G[from].push_back((edge){to, cap, int(G[to].size())});
	G[to].push_back((edge){from, 0, int(G[from].size()-1)});
}

int dfs(int v, int t, int f){
	if(v == t) return f;
	used[v] = 1;
	for(int i=0; i<G[v].size(); ++i){
		edge &e = G[v][i];
		if(used[e.to] || e.cap <= 0) continue;
		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 ford_fulkerson(int s, int t){
	int flow = 0, f = 0;
	while(1){
		memset(used, 0, sizeof(used));
		f = dfs(s, t, inf);
		if(f == 0) return flow;
		flow += f;
	}
}

int main(){
//	cin.tie(0);
//	ios::sync_with_stdio(false);
	cin >> n >> g >> e;
	for(int i=0; i<g; ++i){
		int t;
		cin >> t;
		p.push_back(t);
		add_edge(t, n, 1);
	}
	for(int i=0; i<e; ++i){
		int a, b;
		cin >> a >> b;
		add_edge(a, b, 1);
		add_edge(b, a, 1);
	}
	cout << ford_fulkerson(0, n) << "\n";
}

Submission Info

Judge Result