test/aoj/3198.test.cpp

• View this file on GitHub
• Last update: 2024-09-01 10:56:39+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/problems/3198

Depends on

• 二部グラフ (src/Graph/BipartiteGraph.hpp)
• グラフ (src/Graph/Graph.hpp)
• CSR 表現を用いた二次元配列 他 (src/Internal/ListRange.hpp)

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/3198
// competitive-verifier: TLE 1.5
// competitive-verifier: MLE 64
// 推論補助のtest (しなくても通るが...)
// 推論補助しない場合 (最悪ケースで) 0.7s 程度遅くなる

#include <iostream>
#include <vector>
#include <algorithm>
#include "src/Graph/BipartiteGraph.hpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N, M;
 cin >> N >> M;
 BipartiteGraph bg(N, N, M);
 for (int i= 0; i < M; ++i) cin >> bg[i], --bg[i], bg[i].second+= N;
 int Q;
 cin >> Q;
 std::vector<int> match, partner(N + N, -1);
 while (Q--) {
  int x, y;
  cin >> x >> y, --x, --y, y+= N;
  auto it= std::find(bg.begin(), bg.end(), make_pair(x, y));
  if (it != bg.end()) {
   bg.erase(it);
   if (partner[x] == y) partner[x]= partner[y]= -1;
  } else bg.emplace_back(x, y);
  tie(match, partner)= bipartite_matching(bg, partner);
  cout << (match.size() == N ? "Yes" : "No") << '\n';
 }
 return 0;
}

#line 1 "test/aoj/3198.test.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/3198
// competitive-verifier: TLE 1.5
// competitive-verifier: MLE 64
// 推論補助のtest (しなくても通るが...)
// 推論補助しない場合 (最悪ケースで) 0.7s 程度遅くなる

#include <iostream>
#include <vector>
#include <algorithm>
#line 2 "src/Graph/BipartiteGraph.hpp"
#include <cassert>
#include <tuple>
#line 4 "src/Internal/ListRange.hpp"
#include <iterator>
#include <type_traits>
#define _LR(name, IT, CT) \
 template <class T> struct name { \
  using Iterator= typename std::vector<T>::IT; \
  Iterator bg, ed; \
  Iterator begin() const { return bg; } \
  Iterator end() const { return ed; } \
  size_t size() const { return std::distance(bg, ed); } \
  CT &operator[](int i) const { return bg[i]; } \
 }
_LR(ListRange, iterator, T);
_LR(ConstListRange, const_iterator, const T);
#undef _LR
template <class T> struct CSRArray {
 std::vector<T> dat;
 std::vector<int> p;
 size_t size() const { return p.size() - 1; }
 ListRange<T> operator[](int i) { return {dat.begin() + p[i], dat.begin() + p[i + 1]}; }
 ConstListRange<T> operator[](int i) const { return {dat.cbegin() + p[i], dat.cbegin() + p[i + 1]}; }
};
template <template <class> class F, class T> std::enable_if_t<std::disjunction_v<std::is_same<F<T>, ListRange<T>>, std::is_same<F<T>, ConstListRange<T>>, std::is_same<F<T>, CSRArray<T>>>, std::ostream &> operator<<(std::ostream &os, const F<T> &r) {
 os << '[';
 for (int _= 0, __= r.size(); _ < __; ++_) os << (_ ? ", " : "") << r[_];
 return os << ']';
}
#line 3 "src/Graph/Graph.hpp"
struct Edge: std::pair<int, int> {
 using std::pair<int, int>::pair;
 Edge &operator--() { return --first, --second, *this; }
 int to(int v) const { return first ^ second ^ v; }
 friend std::istream &operator>>(std::istream &is, Edge &e) { return is >> e.first >> e.second, is; }
};
struct Graph: std::vector<Edge> {
 size_t n;
 Graph(size_t n= 0, size_t m= 0): vector(m), n(n) {}
 size_t vertex_size() const { return n; }
 size_t edge_size() const { return size(); }
 size_t add_vertex() { return n++; }
 size_t add_edge(int s, int d) { return emplace_back(s, d), size() - 1; }
 size_t add_edge(Edge e) { return emplace_back(e), size() - 1; }
#define _ADJ_FOR(a, b) \
 for (auto [u, v]: *this) a; \
 for (size_t i= 0; i < n; ++i) p[i + 1]+= p[i]; \
 for (int i= size(); i--;) { \
  auto [u, v]= (*this)[i]; \
  b; \
 }
#define _ADJ(a, b) \
 vector<int> p(n + 1), c(size() << !dir); \
 if (!dir) { \
  _ADJ_FOR((++p[u], ++p[v]), (c[--p[u]]= a, c[--p[v]]= b)) \
 } else if (dir > 0) { \
  _ADJ_FOR(++p[u], c[--p[u]]= a) \
 } else { \
  _ADJ_FOR(++p[v], c[--p[v]]= b) \
 } \
 return {c, p}
 CSRArray<int> adjacency_vertex(int dir) const { _ADJ(v, u); }
 CSRArray<int> adjacency_edge(int dir) const { _ADJ(i, i); }
#undef _ADJ
#undef _ADJ_FOR
};
#line 6 "src/Graph/BipartiteGraph.hpp"
// [0, L) is left, [L, n) is right
struct BipartiteGraph: Graph {
 size_t L;
 BipartiteGraph() {}
 BipartiteGraph(size_t L, size_t R, size_t m= 0): Graph(L + R, m), L(L) {}
 size_t left_size() const { return L; }
 size_t right_size() const { return this->n - L; }
};
std::vector<int> paint_two_colors(const CSRArray<int> &adj) {
 const int n= adj.size();
 std::vector<int> col(n, -1);
 for (int s= n; s--;)
  if (col[s] == -1) {
   std::vector<int> q= {s};
   for (int i= col[s]= 0, v; i < (int)q.size(); ++i)
    for (int u: adj[v= q[i]])
     if (int c= col[v]; col[u] == c) return {};
     else if (col[u] == -1) col[u]= c ^ 1, q.push_back(u);
  }
 return col;
}
std::vector<int> paint_two_colors(const Graph &g) { return paint_two_colors(g.adjacency_vertex(0)); }
// { BipartiteGraph , original to new, new to original }
// {{},{},{}} if not bipartite
std::tuple<BipartiteGraph, std::vector<int>, std::vector<int>> graph_to_bipartite(const Graph &g, std::vector<int> color= {}) {
 if (color.empty()) color= paint_two_colors(g);
 if (color.empty()) return {};
 const int n= g.vertex_size(), m= g.edge_size();
 std::vector<int> a(n), b(n);
 int l= 0, r= n;
 for (int i= n; i--;) b[a[i]= color[i] ? --r : l++]= i;
 BipartiteGraph bg(l, n - l, m);
 for (int i= m; i--;) {
  auto [u, v]= g[i];
  bg[i]= std::minmax(a[u], a[v]);
 }
 return {bg, a, b};
}
namespace _bg_internal {
std::vector<int> _bm(int L, const CSRArray<int> &adj, std::vector<int> &m) {
 std::vector<int> a, p, q(L);
 for (bool u= true; u;) {
  u= false, a.assign(L, -1), p.assign(L, -1);
  int t= 0;
  for (int l= L; l--;)
   if (m[l] == -1) q[t++]= a[l]= p[l]= l;
  for (int i= 0; i < t; ++i)
   if (int l= q[i], x; m[a[l]] == -1)
    for (int r: adj[l]) {
     if (x= m[r]; x == -1) {
      for (u= true; r != -1; l= p[l]) m[r]= l, std::swap(m[l], r);
      break;
     }
     if (p[x] == -1) a[q[t++]= x]= a[p[x]= l];
    }
 }
 return a;
}
}
template <bool lexical= false> std::pair<std::vector<int>, std::vector<int>> bipartite_matching(const BipartiteGraph &bg, std::vector<int> partner= {}) {
 const int L= bg.left_size(), M= bg.edge_size();
 if (partner.empty()) partner.assign(bg.vertex_size(), -1);
 assert(partner.size() == bg.vertex_size());
 {
  CSRArray<int> adj{std::vector<int>(M), std::vector<int>(L + 1)};
  for (auto [l, r]: bg) ++adj.p[l];
  for (int i= 0; i < L; ++i) adj.p[i + 1]+= adj.p[i];
  for (auto [l, r]: bg) adj.dat[--adj.p[l]]= r;
  if constexpr (lexical) {
   for (int l= L; l--;) std::sort(adj[l].begin(), adj[l].end());
   _bg_internal::_bm(L, adj, partner);
   std::vector<char> a(L, 1);
   for (int l= 0; l < L; ++l)
    if (int r= partner[l], v= l; r != -1) {
     std::vector<int> p(L, partner[v]= partner[r]= -1), c(adj.p.begin(), adj.p.begin() + L);
     for (p[v]= -2;;) {
      if (c[v] == adj.p[v + 1]) v= p[v];
      else if (int u= partner[r= adj.dat[c[v]++]]; u == -1) {
       for (; r != -1; v= p[v]) partner[r]= v, std::swap(partner[v], r);
       break;
      } else if (a[u] && p[u] == -1) p[u]= v, v= u;
     }
     a[l]= 0;
    }
  } else _bg_internal::_bm(L, adj, partner);
 }
 std::vector<int> c;
 std::vector<char> p(L);
 for (int i= 0; i < M; ++i)
  if (auto [l, r]= bg[i]; partner[l] == r && !p[l]) c.push_back(i), p[l]= 1;
 return {c, partner};
}
#line 11 "test/aoj/3198.test.cpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N, M;
 cin >> N >> M;
 BipartiteGraph bg(N, N, M);
 for (int i= 0; i < M; ++i) cin >> bg[i], --bg[i], bg[i].second+= N;
 int Q;
 cin >> Q;
 std::vector<int> match, partner(N + N, -1);
 while (Q--) {
  int x, y;
  cin >> x >> y, --x, --y, y+= N;
  auto it= std::find(bg.begin(), bg.end(), make_pair(x, y));
  if (it != bg.end()) {
   bg.erase(it);
   if (partner[x] == y) partner[x]= partner[y]= -1;
  } else bg.emplace_back(x, y);
  tie(match, partner)= bipartite_matching(bg, partner);
  cout << (match.size() == N ? "Yes" : "No") << '\n';
 }
 return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-13	00_sample01	AC	7 ms	4 MB
g++-13	01_small_random_01	AC	8 ms	4 MB
g++-13	01_small_random_02	AC	12 ms	4 MB
g++-13	01_small_random_03	AC	13 ms	4 MB
g++-13	01_small_random_04	AC	9 ms	4 MB
g++-13	01_small_random_05	AC	33 ms	4 MB
g++-13	01_small_random_06	AC	9 ms	4 MB
g++-13	01_small_random_07	AC	10 ms	4 MB
g++-13	01_small_random_08	AC	24 ms	4 MB
g++-13	01_small_random_09	AC	7 ms	4 MB
g++-13	01_small_random_10	AC	9 ms	4 MB
g++-13	02_random_01	AC	34 ms	4 MB
g++-13	02_random_02	AC	25 ms	4 MB
g++-13	02_random_03	AC	58 ms	4 MB
g++-13	02_random_04	AC	234 ms	4 MB
g++-13	02_random_05	AC	94 ms	4 MB
g++-13	02_random_06	AC	116 ms	4 MB
g++-13	02_random_07	AC	78 ms	4 MB
g++-13	02_random_08	AC	168 ms	4 MB
g++-13	02_random_09	AC	162 ms	4 MB
g++-13	02_random_10	AC	150 ms	4 MB
g++-13	03_max_00	AC	435 ms	4 MB
g++-13	03_max_01	AC	264 ms	4 MB
g++-13	04_random_plus_01	AC	50 ms	4 MB
g++-13	04_random_plus_02	AC	44 ms	4 MB
g++-13	04_random_plus_03	AC	42 ms	4 MB
g++-13	04_random_plus_04	AC	43 ms	4 MB
g++-13	04_random_plus_05	AC	22 ms	4 MB
g++-13	04_random_plus_06	AC	9 ms	4 MB
g++-13	04_random_plus_07	AC	36 ms	4 MB
g++-13	04_random_plus_08	AC	65 ms	4 MB
g++-13	04_random_plus_09	AC	78 ms	4 MB
g++-13	04_random_plus_10	AC	42 ms	4 MB
clang++-18	00_sample01	AC	6 ms	4 MB
clang++-18	01_small_random_01	AC	6 ms	4 MB
clang++-18	01_small_random_02	AC	11 ms	4 MB
clang++-18	01_small_random_03	AC	11 ms	4 MB
clang++-18	01_small_random_04	AC	8 ms	4 MB
clang++-18	01_small_random_05	AC	29 ms	4 MB
clang++-18	01_small_random_06	AC	8 ms	4 MB
clang++-18	01_small_random_07	AC	8 ms	4 MB
clang++-18	01_small_random_08	AC	20 ms	4 MB
clang++-18	01_small_random_09	AC	6 ms	4 MB
clang++-18	01_small_random_10	AC	7 ms	4 MB
clang++-18	02_random_01	AC	30 ms	4 MB
clang++-18	02_random_02	AC	22 ms	4 MB
clang++-18	02_random_03	AC	48 ms	4 MB
clang++-18	02_random_04	AC	222 ms	4 MB
clang++-18	02_random_05	AC	87 ms	4 MB
clang++-18	02_random_06	AC	102 ms	4 MB
clang++-18	02_random_07	AC	66 ms	4 MB
clang++-18	02_random_08	AC	136 ms	4 MB
clang++-18	02_random_09	AC	144 ms	4 MB
clang++-18	02_random_10	AC	140 ms	4 MB
clang++-18	03_max_00	AC	400 ms	4 MB
clang++-18	03_max_01	AC	213 ms	4 MB
clang++-18	04_random_plus_01	AC	47 ms	4 MB
clang++-18	04_random_plus_02	AC	39 ms	4 MB
clang++-18	04_random_plus_03	AC	36 ms	4 MB
clang++-18	04_random_plus_04	AC	37 ms	4 MB
clang++-18	04_random_plus_05	AC	20 ms	4 MB
clang++-18	04_random_plus_06	AC	8 ms	4 MB
clang++-18	04_random_plus_07	AC	33 ms	4 MB
clang++-18	04_random_plus_08	AC	61 ms	4 MB
clang++-18	04_random_plus_09	AC	73 ms	4 MB
clang++-18	04_random_plus_10	AC	36 ms	4 MB

Back to top page