test/verify/aoj-dsl-1-a.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_A

Depends on

• Union Find (structure/union-find/union-find.hpp)
• template/template.hpp

Code

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

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

#include "../../structure/union-find/union-find.hpp"

int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);
  UnionFind uf(N);
  while(Q--) {
    int t, x, y;
    scanf("%d %d %d", &t, &x, &y);
    if(t == 0) uf.unite(x, y);
    else printf("%d\n", uf.find(x) == uf.find(y));
  }
}

#line 1 "test/verify/aoj-dsl-1-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_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-dsl-1-a.test.cpp"

#line 2 "structure/union-find/union-find.hpp"

struct UnionFind {
  vector<int> data;

  UnionFind() = default;

  explicit UnionFind(size_t sz) : data(sz, -1) {}

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  int find(int k) {
    if (data[k] < 0) return (k);
    return data[k] = find(data[k]);
  }

  int size(int k) { return -data[find(k)]; }

  bool same(int x, int y) { return find(x) == find(y); }

  vector<vector<int> > groups() {
    int n = (int)data.size();
    vector<vector<int> > ret(n);
    for (int i = 0; i < n; i++) {
      ret[find(i)].emplace_back(i);
    }
    ret.erase(remove_if(begin(ret), end(ret),
                        [&](const vector<int> &v) { return v.empty(); }),
              end(ret));
    return ret;
  }
};
#line 6 "test/verify/aoj-dsl-1-a.test.cpp"

int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);
  UnionFind uf(N);
  while(Q--) {
    int t, x, y;
    scanf("%d %d %d", &t, &x, &y);
    if(t == 0) uf.unite(x, y);
    else printf("%d\n", uf.find(x) == uf.find(y));
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_small_00.in	AC	6 ms	4 MB
g++	00_small_01.in	AC	6 ms	4 MB
g++	01_rand_00.in	AC	6 ms	4 MB
g++	01_rand_01.in	AC	6 ms	4 MB
g++	01_rand_02.in	AC	6 ms	4 MB
g++	01_rand_03.in	AC	6 ms	4 MB
g++	01_rand_04.in	AC	6 ms	4 MB
g++	01_rand_05.in	AC	6 ms	4 MB
g++	02_linear_00.in	AC	6 ms	4 MB
g++	02_linear_01.in	AC	6 ms	4 MB
g++	02_linear_02.in	AC	7 ms	4 MB
g++	02_linear_03.in	AC	9 ms	4 MB
g++	03_grid_00.in	AC	6 ms	4 MB
g++	03_grid_01.in	AC	6 ms	4 MB
g++	03_grid_02.in	AC	6 ms	4 MB
g++	03_grid_03.in	AC	6 ms	4 MB
g++	03_grid_04.in	AC	6 ms	4 MB
g++	03_grid_05.in	AC	6 ms	4 MB
g++	03_grid_06.in	AC	6 ms	4 MB
g++	03_grid_07.in	AC	6 ms	4 MB
g++	03_grid_08.in	AC	6 ms	4 MB
g++	04_critical_00.in	AC	9 ms	4 MB
g++	04_critical_01.in	AC	9 ms	4 MB
g++	05_groups_00.in	AC	13 ms	4 MB
g++	05_groups_01.in	AC	13 ms	4 MB
g++	05_groups_02.in	AC	13 ms	4 MB
g++	05_groups_03.in	AC	13 ms	4 MB
g++	05_groups_04.in	AC	13 ms	4 MB
g++	06_randmax_00.in	AC	6 ms	4 MB
g++	06_randmax_01.in	AC	14 ms	4 MB
g++	06_randmax_02.in	AC	18 ms	4 MB
g++	06_randmax_03.in	AC	23 ms	4 MB
clang++	00_small_00.in	AC	6 ms	4 MB
clang++	00_small_01.in	AC	6 ms	4 MB
clang++	01_rand_00.in	AC	6 ms	4 MB
clang++	01_rand_01.in	AC	6 ms	4 MB
clang++	01_rand_02.in	AC	6 ms	4 MB
clang++	01_rand_03.in	AC	6 ms	4 MB
clang++	01_rand_04.in	AC	6 ms	4 MB
clang++	01_rand_05.in	AC	6 ms	4 MB
clang++	02_linear_00.in	AC	6 ms	4 MB
clang++	02_linear_01.in	AC	6 ms	4 MB
clang++	02_linear_02.in	AC	7 ms	4 MB
clang++	02_linear_03.in	AC	9 ms	4 MB
clang++	03_grid_00.in	AC	6 ms	4 MB
clang++	03_grid_01.in	AC	6 ms	4 MB
clang++	03_grid_02.in	AC	6 ms	4 MB
clang++	03_grid_03.in	AC	6 ms	4 MB
clang++	03_grid_04.in	AC	6 ms	4 MB
clang++	03_grid_05.in	AC	6 ms	4 MB
clang++	03_grid_06.in	AC	6 ms	4 MB
clang++	03_grid_07.in	AC	6 ms	4 MB
clang++	03_grid_08.in	AC	6 ms	4 MB
clang++	04_critical_00.in	AC	9 ms	4 MB
clang++	04_critical_01.in	AC	9 ms	4 MB
clang++	05_groups_00.in	AC	13 ms	4 MB
clang++	05_groups_01.in	AC	13 ms	4 MB
clang++	05_groups_02.in	AC	13 ms	4 MB
clang++	05_groups_03.in	AC	13 ms	4 MB
clang++	05_groups_04.in	AC	13 ms	4 MB
clang++	06_randmax_00.in	AC	6 ms	4 MB
clang++	06_randmax_01.in	AC	14 ms	4 MB
clang++	06_randmax_02.in	AC	18 ms	4 MB
clang++	06_randmax_03.in	AC	24 ms	4 MB

Back to top page