test/matching_on_bipartite_graph.test.cpp

View this file on GitHub
Last update: 2024-07-28 21:04:51+08:00
Problem: https://judge.yosupo.jp/problem/bipartitematching

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/bipartitematching"

#include "../default/t.cpp"
#include "../graph/Dinic.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int l, r, m; cin >> l >> r >> m;
  const int s = l + r, t = l + r + 1;
  Dinic<int> dinic(l + r + 2);
  for(int i = 0; i < l; i++) dinic.addEdge(s, i, 1);
  for(int i = l; i < l + r; i++) dinic.addEdge(i, t, 1);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    dinic.addEdge(u, v + l, 1);
  }

  cout << dinic.runFlow(s, t) << '\n';
  for(int v = 0; v < l; v++)
    for(auto &e : dinic.g[v])
      if (e.cap == 0 and e.to != s)
        cout << v << ' ' << e.to - l << '\n';

  return 0;
}

#line 1 "test/matching_on_bipartite_graph.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/bipartitematching"

#line 1 "default/t.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
#line 1 "graph/Dinic.cpp"
template<class T>
struct Dinic {
  struct edge {
    int to, rev;
    T cap;
    edge(int _to, T _cap, int _rev)
     : to(_to), rev(_rev), cap(_cap) {}
  };

  int n;
  const T CAP_MAX = numeric_limits<T>::max();
  vector<vector<edge>> g;
  vector<int> lev, iter;

  Dinic(int _n) : n(_n), g(n), lev(n), iter(n) {}

  void addEdge(int from, int to, T cap) {
    g[from].emplace_back(to, cap, ssize(g[to]));
    g[to].emplace_back(from, 0, ssize(g[from]) - 1);
  }

  bool bfs(int s, int t) {
    fill(lev.begin(), lev.end(), INT_MAX);
    lev[s] = 0;
    queue<int> q;
    q.push(s);
    while(!q.empty()) {
      int v = q.front(); q.pop();
      for(edge &e : g[v]) if (e.cap > 0 and lev[e.to] == INT_MAX) {
        lev[e.to] = lev[v] + 1;
        q.push(e.to);
      }
    }
    return lev[t] != INT_MAX;
  }

  T runFlow(int s, int t) {
    auto dfs = [&](int v, T f, auto &&self) -> T {
      if (v == s) return f;
      for(int &i = iter[v]; i < ssize(g[v]); i++) {
        edge &e = g[v][i];
        if (T tmp; lev[e.to] == lev[v] - 1 and g[e.to][e.rev].cap > 0) {
          if ((tmp = self(e.to, min(f, g[e.to][e.rev].cap), self)) > 0) {
            e.cap += tmp, g[e.to][e.rev].cap -= tmp;
            return tmp;
          }
        }
      }
      return 0;
    };
    T flow = 0, del;
    while(bfs(s, t)) {
      fill(iter.begin(), iter.end(), 0);
      while((del = dfs(t, CAP_MAX, dfs)) > 0)
        flow = (flow >= CAP_MAX - del ? CAP_MAX : flow + del);
    }

    return flow;
  }

  bool left(int idx) { return lev[idx] != INT_MAX; }
};
#line 5 "test/matching_on_bipartite_graph.test.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int l, r, m; cin >> l >> r >> m;
  const int s = l + r, t = l + r + 1;
  Dinic<int> dinic(l + r + 2);
  for(int i = 0; i < l; i++) dinic.addEdge(s, i, 1);
  for(int i = l; i < l + r; i++) dinic.addEdge(i, t, 1);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    dinic.addEdge(u, v + l, 1);
  }

  cout << dinic.runFlow(s, t) << '\n';
  for(int v = 0; v < l; v++)
    for(auto &e : dinic.g[v])
      if (e.cap == 0 and e.to != s)
        cout << v << ' ' << e.to - l << '\n';

  return 0;
}