Submission #1595314

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

struct edge {
  int to, cap, rev;
  edge() {}
  edge(int t, int c, int r): to(t), cap(c), rev(r) {}
};

const int INF = 1e9;
vector<edge> G[110];
bool used[110];

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;
  for (int i = 0; i < G[v].size(); i++) {
    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(void) {
  int n, g, e;
  cin >> n >> g >> e;

  vector<int> p(g);
  for (int i = 0; i < g; i++) {
    cin >> p[i];
    add_edge(p[i], 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 << max_flow(0, n) << endl;

  return 0;
}

Submission Info

Judge Result