This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_C
#include <bits/stdc++.h>
#include "../graph/tree/union-find-lowest-common-ancestor.hpp"
using namespace std;
#ifdef LOCAL
#include "copypaste/debug.h"
#else
#define debug(...) 42
#endif
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int main() {
#ifdef LOCAL
freopen("./data.in", "r", stdin);
#endif
int n, q;
cin >> n;
UnionFindLowestCommonAncestor<> lca(n);
for (int i = 0; i < n; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int c;
cin >> c;
lca.add_edge(i, c);
}
}
cin >> q;
vector<pair<int, int>> queries(q);
for (int i = 0; i < q; i++) {
int u, v;
cin >> u >> v;
queries[i] = {u, v};
}
auto ans = lca.build(queries);
for (auto it : ans) {
cout << it << endl;
}
}
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.12/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.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
bundler.update(path)
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 477, in update
raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: test/aoj-grl-5-c-4.test.cpp: line 9: unable to process #include in #if / #ifdef / #ifndef other than include guards
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_00.in |
![]() |
6 ms | 4 MB |
g++ | 01_small_00.in |
![]() |
5 ms | 4 MB |
g++ | 02_middle_00.in |
![]() |
5 ms | 4 MB |
g++ | 02_middle_01.in |
![]() |
5 ms | 4 MB |
g++ | 02_middle_02.in |
![]() |
5 ms | 3 MB |
g++ | 02_middle_03.in |
![]() |
5 ms | 3 MB |
g++ | 03_corner_00.in |
![]() |
5 ms | 4 MB |
g++ | 03_corner_01.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_00.in |
![]() |
4 ms | 3 MB |
g++ | 04_rand_01.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_02.in |
![]() |
4 ms | 4 MB |
g++ | 04_rand_03.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_04.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_05.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_06.in |
![]() |
5 ms | 4 MB |
g++ | 04_rand_07.in |
![]() |
5 ms | 4 MB |
g++ | 05_complete_00.in |
![]() |
5 ms | 4 MB |
g++ | 05_complete_01.in |
![]() |
5 ms | 3 MB |
g++ | 05_complete_02.in |
![]() |
6 ms | 4 MB |
g++ | 05_complete_03.in |
![]() |
6 ms | 4 MB |
g++ | 05_complete_04.in |
![]() |
7 ms | 4 MB |
g++ | 05_complete_05.in |
![]() |
9 ms | 4 MB |
g++ | 05_complete_06.in |
![]() |
15 ms | 5 MB |
g++ | 05_complete_07.in |
![]() |
31 ms | 10 MB |
g++ | 06_biased_00.in |
![]() |
94 ms | 10 MB |
g++ | 06_biased_01.in |
![]() |
143 ms | 40 MB |
g++ | 06_biased_02.in |
![]() |
126 ms | 19 MB |
g++ | 06_biased_03.in |
![]() |
122 ms | 28 MB |
g++ | 07_large_00.in |
![]() |
130 ms | 20 MB |
g++ | 07_large_01.in |
![]() |
136 ms | 20 MB |
g++ | 07_large_02.in |
![]() |
143 ms | 20 MB |
g++ | 07_large_03.in |
![]() |
140 ms | 20 MB |