This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/DSL_1_A
#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif
#include "graph/union_find.cpp"
int main() {
int N, Q;
cin >> N >> Q;
UnionFind uf(N);
for(int i = 0; i < Q; i++) {
int com, x, y;
cin >> com >> x >> y;
if(com == 0) uf.merge(x, y);
else
cout << (uf.same(x, y) ? 1 : 0) << '\n';
}
cout << flush;
}
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
bundled_code = language.bundle(path, basedir=basedir)
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
bundler.update(path)
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 422, in update
raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: test/aoj_DSL_1_A.cpp: line 9: found codes out of include guard
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_small_00.in | AC | 6 ms | 3 MB |
g++ | 00_small_01.in | AC | 5 ms | 3 MB |
g++ | 01_rand_00.in | AC | 5 ms | 3 MB |
g++ | 01_rand_01.in | AC | 5 ms | 3 MB |
g++ | 01_rand_02.in | AC | 5 ms | 3 MB |
g++ | 01_rand_03.in | AC | 5 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 | 7 ms | 3 MB |
g++ | 02_linear_02.in | AC | 16 ms | 3 MB |
g++ | 02_linear_03.in | AC | 28 ms | 4 MB |
g++ | 03_grid_00.in | AC | 6 ms | 3 MB |
g++ | 03_grid_01.in | AC | 5 ms | 3 MB |
g++ | 03_grid_02.in | AC | 5 ms | 3 MB |
g++ | 03_grid_03.in | AC | 5 ms | 3 MB |
g++ | 03_grid_04.in | AC | 5 ms | 3 MB |
g++ | 03_grid_05.in | AC | 5 ms | 3 MB |
g++ | 03_grid_06.in | AC | 5 ms | 3 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 | 25 ms | 3 MB |
g++ | 04_critical_01.in | AC | 25 ms | 4 MB |
g++ | 05_groups_00.in | AC | 38 ms | 4 MB |
g++ | 05_groups_01.in | AC | 38 ms | 4 MB |
g++ | 05_groups_02.in | AC | 40 ms | 4 MB |
g++ | 05_groups_03.in | AC | 37 ms | 4 MB |
g++ | 05_groups_04.in | AC | 38 ms | 4 MB |
g++ | 06_randmax_00.in | AC | 8 ms | 4 MB |
g++ | 06_randmax_01.in | AC | 57 ms | 4 MB |
g++ | 06_randmax_02.in | AC | 77 ms | 4 MB |
g++ | 06_randmax_03.in | AC | 103 ms | 4 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 | 5 ms | 3 MB |
clang++ | 01_rand_02.in | AC | 5 ms | 3 MB |
clang++ | 01_rand_03.in | AC | 5 ms | 3 MB |
clang++ | 01_rand_04.in | AC | 6 ms | 3 MB |
clang++ | 01_rand_05.in | AC | 6 ms | 3 MB |
clang++ | 02_linear_00.in | AC | 5 ms | 3 MB |
clang++ | 02_linear_01.in | AC | 7 ms | 3 MB |
clang++ | 02_linear_02.in | AC | 16 ms | 3 MB |
clang++ | 02_linear_03.in | AC | 28 ms | 4 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 | 5 ms | 3 MB |
clang++ | 03_grid_03.in | AC | 6 ms | 3 MB |
clang++ | 03_grid_04.in | AC | 5 ms | 3 MB |
clang++ | 03_grid_05.in | AC | 5 ms | 3 MB |
clang++ | 03_grid_06.in | AC | 5 ms | 3 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 | 25 ms | 3 MB |
clang++ | 04_critical_01.in | AC | 25 ms | 4 MB |
clang++ | 05_groups_00.in | AC | 39 ms | 4 MB |
clang++ | 05_groups_01.in | AC | 39 ms | 4 MB |
clang++ | 05_groups_02.in | AC | 38 ms | 4 MB |
clang++ | 05_groups_03.in | AC | 38 ms | 4 MB |
clang++ | 05_groups_04.in | AC | 49 ms | 4 MB |
clang++ | 06_randmax_00.in | AC | 8 ms | 4 MB |
clang++ | 06_randmax_01.in | AC | 58 ms | 3 MB |
clang++ | 06_randmax_02.in | AC | 77 ms | 4 MB |
clang++ | 06_randmax_03.in | AC | 122 ms | 3 MB |