test/verify/aoj-grl-7-a.test.cpp

• View this file on GitHub
• Last update: 2024-04-24 02:34:04+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A

Depends on

• Bipartite-Matching(二部グラフの最大マッチング) (graph/flow/bipartite-matching.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A

#include "../../template/template.hpp"

#include "../../graph/flow/bipartite-matching.hpp"

int main() {
  int X, Y, E;
  scanf("%d %d %d", &X, &Y, &E);
  BipartiteMatching bm(X + Y);
  for(int i = 0; i < E; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    bm.add_edge(a, X + b);
  }
  printf("%d\n", bm.bipartite_matching());
}

#line 1 "test/verify/aoj-grl-7-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_7_A

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
 
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/aoj-grl-7-a.test.cpp"

#line 1 "graph/flow/bipartite-matching.hpp"
/**
 * @brief Bipartite-Matching(二部グラフの最大マッチング)
 * 
 */
struct BipartiteMatching {
  vector< vector< int > > graph;
  vector< int > alive, used, match;
  int timestamp;

  explicit BipartiteMatching(int n) : graph(n), alive(n, 1), used(n, 0), match(n, -1), timestamp(0) {}

  void add_edge(int u, int v) {
    graph[u].push_back(v);
    graph[v].push_back(u);
  }

  bool augment(int idx) {
    used[idx] = timestamp;
    for(auto &to : graph[idx]) {
      int to_match = match[to];
      if(alive[to] == 0) continue;
      if(to_match == -1 || (used[to_match] != timestamp && augment(to_match))) {
        match[idx] = to;
        match[to] = idx;
        return true;
      }
    }
    return false;
  }

  int bipartite_matching() {
    int ret = 0;
    for(int i = 0; i < (int) graph.size(); i++) {
      if(alive[i] == 0) continue;
      if(match[i] == -1) {
        ++timestamp;
        ret += augment(i);
      }
    }
    return ret;
  }

  int add_vertex(int idx) {
    alive[idx] = 1;
    ++timestamp;
    return augment(idx);
  }

  int erase_vertex(int idx) {
    alive[idx] = 0;
    if(match[idx] == -1) {
      return 0;
    }
    match[match[idx]] = -1;
    ++timestamp;
    int ret = augment(match[idx]);
    match[idx] = -1;
    return ret - 1;
  }

  void output() const {
    for(int i = 0; i < (int) graph.size(); i++) {
      if(i < match[i]) {
        cout << i << "-" << match[i] << endl;
      }
    }
  }
};
#line 6 "test/verify/aoj-grl-7-a.test.cpp"

int main() {
  int X, Y, E;
  scanf("%d %d %d", &X, &Y, &E);
  BipartiteMatching bm(X + Y);
  for(int i = 0; i < E; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    bm.add_edge(a, X + b);
  }
  printf("%d\n", bm.bipartite_matching());
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	01_small_00.in	AC	6 ms	4 MB
g++	01_small_01.in	AC	6 ms	4 MB
g++	02_corner_00.in	AC	6 ms	4 MB
g++	02_corner_01.in	AC	6 ms	4 MB
g++	03_medium_00.in	AC	6 ms	4 MB
g++	03_medium_01.in	AC	6 ms	4 MB
g++	03_medium_02.in	AC	6 ms	4 MB
g++	03_medium_03.in	AC	6 ms	4 MB
g++	03_medium_04.in	AC	6 ms	4 MB
g++	04_rand_00.in	AC	6 ms	4 MB
g++	04_rand_01.in	AC	7 ms	4 MB
g++	04_rand_02.in	AC	6 ms	4 MB
g++	04_rand_03.in	AC	6 ms	4 MB
g++	04_rand_04.in	AC	6 ms	4 MB
g++	04_rand_05.in	AC	6 ms	4 MB
g++	04_rand_06.in	AC	6 ms	4 MB
g++	04_rand_07.in	AC	6 ms	4 MB
g++	04_rand_08.in	AC	7 ms	4 MB
g++	04_rand_09.in	AC	6 ms	4 MB
g++	05_large_00.in	AC	6 ms	4 MB
g++	05_large_01.in	AC	7 ms	4 MB
g++	05_large_02.in	AC	6 ms	4 MB
g++	05_large_03.in	AC	6 ms	4 MB
g++	06_sparse_00.in	AC	6 ms	4 MB
g++	06_sparse_01.in	AC	6 ms	4 MB
g++	06_sparse_02.in	AC	6 ms	4 MB
g++	06_sparse_03.in	AC	6 ms	4 MB
g++	07_all_00.in	AC	6 ms	4 MB
g++	07_all_01.in	AC	6 ms	4 MB
g++	07_all_02.in	AC	6 ms	4 MB
g++	07_all_03.in	AC	6 ms	4 MB
g++	07_all_04.in	AC	6 ms	4 MB
g++	07_all_05.in	AC	6 ms	4 MB
g++	08_biased_00.in	AC	6 ms	4 MB
g++	08_biased_01.in	AC	6 ms	4 MB
g++	09_complete_00.in	AC	7 ms	4 MB
g++	09_complete_01.in	AC	7 ms	4 MB
g++	09_complete_02.in	AC	7 ms	4 MB
g++	09_complete_03.in	AC	7 ms	4 MB
clang++	00_sample_00.in	AC	6 ms	4 MB
clang++	01_small_00.in	AC	6 ms	4 MB
clang++	01_small_01.in	AC	6 ms	4 MB
clang++	02_corner_00.in	AC	6 ms	4 MB
clang++	02_corner_01.in	AC	6 ms	4 MB
clang++	03_medium_00.in	AC	6 ms	4 MB
clang++	03_medium_01.in	AC	6 ms	4 MB
clang++	03_medium_02.in	AC	6 ms	4 MB
clang++	03_medium_03.in	AC	6 ms	4 MB
clang++	03_medium_04.in	AC	6 ms	4 MB
clang++	04_rand_00.in	AC	6 ms	4 MB
clang++	04_rand_01.in	AC	6 ms	4 MB
clang++	04_rand_02.in	AC	6 ms	4 MB
clang++	04_rand_03.in	AC	6 ms	4 MB
clang++	04_rand_04.in	AC	6 ms	4 MB
clang++	04_rand_05.in	AC	6 ms	4 MB
clang++	04_rand_06.in	AC	6 ms	4 MB
clang++	04_rand_07.in	AC	6 ms	4 MB
clang++	04_rand_08.in	AC	6 ms	4 MB
clang++	04_rand_09.in	AC	6 ms	4 MB
clang++	05_large_00.in	AC	6 ms	4 MB
clang++	05_large_01.in	AC	6 ms	4 MB
clang++	05_large_02.in	AC	6 ms	4 MB
clang++	05_large_03.in	AC	6 ms	4 MB
clang++	06_sparse_00.in	AC	6 ms	4 MB
clang++	06_sparse_01.in	AC	6 ms	4 MB
clang++	06_sparse_02.in	AC	6 ms	4 MB
clang++	06_sparse_03.in	AC	6 ms	4 MB
clang++	07_all_00.in	AC	6 ms	4 MB
clang++	07_all_01.in	AC	6 ms	4 MB
clang++	07_all_02.in	AC	6 ms	4 MB
clang++	07_all_03.in	AC	6 ms	4 MB
clang++	07_all_04.in	AC	6 ms	4 MB
clang++	07_all_05.in	AC	6 ms	4 MB
clang++	08_biased_00.in	AC	6 ms	4 MB
clang++	08_biased_01.in	AC	6 ms	4 MB
clang++	09_complete_00.in	AC	7 ms	4 MB
clang++	09_complete_01.in	AC	7 ms	4 MB
clang++	09_complete_02.in	AC	7 ms	4 MB
clang++	09_complete_03.in	AC	7 ms	4 MB

Back to top page