#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_A"
#include <iostream>
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/macros.hpp"
using namespace std;
int main() {
int n, q; cin >> n >> q;
union_find uf(n);
REP (i, q) {
int com, x, y; cin >> com >> x >> y;
if (com == 0) {
uf.unite_trees(x, y);
} else if (com == 1) {
cout << uf.is_same(x, y) << endl;
}
}
return 0;
}
#line 1 "examples/cpp/union_find.aoj.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_A"
#include <iostream>
#line 1 "examples/cpp/union_find.hpp"
#include <algorithm>
#include <vector>
/**
* @brief a Union-Find
* @note most operations in $O(\alpha(n))$ where $\alpha(n)$ is the inverse of Ackermann function
* @note implemented with union-by-size + path-compression
*/
struct union_find {
std::vector<int> data;
union_find() = default;
explicit union_find(int n) : data(n, -1) {}
bool is_root(int i) { return data[i] < 0; }
int find_root(int i) { return is_root(i) ? i : (data[i] = find_root(data[i])); }
int tree_size(int i) { return - data[find_root(i)]; }
int unite_trees(int i, int j) {
i = find_root(i); j = find_root(j);
if (i != j) {
if (tree_size(i) < tree_size(j)) std::swap(i, j);
data[i] += data[j];
data[j] = i;
}
return i;
}
bool is_same(int i, int j) { return find_root(i) == find_root(j); }
};
#line 1 "examples/cpp/macros.hpp"
// for 文用マクロ
#line 4 "examples/cpp/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) begin(x), end(x)
#line 9 "examples/cpp/union_find.aoj.test.cpp"
using namespace std;
int main() {
int n, q; cin >> n >> q;
union_find uf(n);
REP (i, q) {
int com, x, y; cin >> com >> x >> y;
if (com == 0) {
uf.unite_trees(x, y);
} else if (com == 1) {
cout << uf.is_same(x, y) << endl;
}
}
return 0;
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_small_00.in | AC | 6 ms | 3 MB |
g++ | 00_small_01.in | AC | 6 ms | 3 MB |
g++ | 01_rand_00.in | AC | 6 ms | 3 MB |
g++ | 01_rand_01.in | AC | 6 ms | 3 MB |
g++ | 01_rand_02.in | AC | 6 ms | 3 MB |
g++ | 01_rand_03.in | AC | 6 ms | 3 MB |
g++ | 01_rand_04.in | AC | 6 ms | 3 MB |
g++ | 01_rand_05.in | AC | 6 ms | 3 MB |
g++ | 02_linear_00.in | AC | 5 ms | 3 MB |
g++ | 02_linear_01.in | AC | 8 ms | 3 MB |
g++ | 02_linear_02.in | AC | 25 ms | 3 MB |
g++ | 02_linear_03.in | AC | 26 ms | 3 MB |
g++ | 03_grid_00.in | AC | 6 ms | 3 MB |
g++ | 03_grid_01.in | AC | 6 ms | 3 MB |
g++ | 03_grid_02.in | AC | 6 ms | 3 MB |
g++ | 03_grid_03.in | AC | 6 ms | 3 MB |
g++ | 03_grid_04.in | AC | 6 ms | 3 MB |
g++ | 03_grid_05.in | AC | 6 ms | 3 MB |
g++ | 03_grid_06.in | AC | 6 ms | 3 MB |
g++ | 03_grid_07.in | AC | 7 ms | 3 MB |
g++ | 03_grid_08.in | AC | 6 ms | 4 MB |
g++ | 04_critical_00.in | AC | 38 ms | 3 MB |
g++ | 04_critical_01.in | AC | 26 ms | 3 MB |
g++ | 05_groups_00.in | AC | 38 ms | 3 MB |
g++ | 05_groups_01.in | AC | 38 ms | 4 MB |
g++ | 05_groups_02.in | AC | 38 ms | 4 MB |
g++ | 05_groups_03.in | AC | 38 ms | 3 MB |
g++ | 05_groups_04.in | AC | 50 ms | 3 MB |
g++ | 06_randmax_00.in | AC | 10 ms | 4 MB |
g++ | 06_randmax_01.in | AC | 61 ms | 4 MB |
g++ | 06_randmax_02.in | AC | 79 ms | 3 MB |
g++ | 06_randmax_03.in | AC | 106 ms | 3 MB |
clang++ | 00_small_00.in | AC | 6 ms | 3 MB |
clang++ | 00_small_01.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_00.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_01.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_02.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_03.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_04.in | AC | 7 ms | 3 MB |
clang++ | 01_rand_05.in | AC | 7 ms | 3 MB |
clang++ | 02_linear_00.in | AC | 6 ms | 3 MB |
clang++ | 02_linear_01.in | AC | 9 ms | 3 MB |
clang++ | 02_linear_02.in | AC | 25 ms | 3 MB |
clang++ | 02_linear_03.in | AC | 46 ms | 3 MB |
clang++ | 03_grid_00.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_01.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_02.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_03.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_04.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_05.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_06.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_07.in | AC | 7 ms | 3 MB |
clang++ | 03_grid_08.in | AC | 8 ms | 3 MB |
clang++ | 04_critical_00.in | AC | 38 ms | 4 MB |
clang++ | 04_critical_01.in | AC | 37 ms | 3 MB |
clang++ | 05_groups_00.in | AC | 50 ms | 3 MB |
clang++ | 05_groups_01.in | AC | 50 ms | 3 MB |
clang++ | 05_groups_02.in | AC | 50 ms | 4 MB |
clang++ | 05_groups_03.in | AC | 50 ms | 4 MB |
clang++ | 05_groups_04.in | AC | 50 ms | 3 MB |
clang++ | 06_randmax_00.in | AC | 10 ms | 3 MB |
clang++ | 06_randmax_01.in | AC | 105 ms | 4 MB |
clang++ | 06_randmax_02.in | AC | 140 ms | 3 MB |
clang++ | 06_randmax_03.in | AC | 193 ms | 4 MB |