Submission #180966

---

Source Code Expand

#include <vector>
#include <iostream>
#include <set>
#include <cstdio>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <tuple>
#include <algorithm>
#include <limits>
#include <map>

using namespace std;

const int MAX_V = 200;
const int INT_INF = 1<<28;
struct edge {int to, cap, rev;};

vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];

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});
}

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

void bfs(int s) {
    fill_n(level, MAX_V, -1);
    queue<int> que;
    level[s] = 0;
    que.push(s);
    while (!que.empty()) {
        int v = que.front(); que.pop();
        for (int i = 0; i < G[v].size(); i++) {
            edge &e = G[v][i];
            if (e.cap > 0 && level[e.to] < 0) {
                level[e.to] = level[v] + 1;
                que.push(e.to);
            }
        }
    }
}

int dfs (int v, int t, int f) {
    if (v == t) return f;
    for (int &i = iter[v]; i < G[v].size(); i++) {
        edge &e = G[v][i];
        if (e.cap > 0 && level[v] < level[e.to]) {
            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;
    while (true) {
        bfs(s);
        if (level[t] < 0) return flow;
        fill_n(iter, MAX_V, 0);
        int f;
        while ((f = dfs(s, t, INT_INF)) > 0) {
            flow += f;
        }
    }
}

int main() {
    int n, g, e;
    cin >> n >> g >> e;
    for (int i = 0; i < g; i++) {
        int d;
        cin >> d;
        add_edge_multi(d, 190, 1);
    }
    for (int i = 0; i < e; i++) {
        int a, b;
        cin >> a >> b;
        add_edge_multi(a, b, 1);
    }
    cout << max_flow(0, 190) << endl;
    return 0;
}

Submission Info

Judge Result