This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_C
#include "../../template/template.hpp"
#include "../../graph/tree/rmq-lowest-common-ancestor.hpp"
int main() {
int N, Q;
cin >> N;
RMQLowestCommonAncestor< int > 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);
}
}
lca.build();
cin >> Q;
for(int i = 0; i < Q; i++) {
int u, v;
cin >> u >> v;
cout << lca.lca(u, v) << "\n";
}
}
#line 1 "test/verify/aoj-grl-5-c-3.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_5_C
#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-grl-5-c-3.test.cpp"
#line 2 "graph/tree/rmq-lowest-common-ancestor.hpp"
#line 2 "graph/graph-template.hpp"
/**
* @brief Graph Template(グラフテンプレート)
*/
template< typename T = int >
struct Edge {
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}
operator int() const { return to; }
};
template< typename T = int >
struct Graph {
vector< vector< Edge< T > > > g;
int es;
Graph() = default;
explicit Graph(int n) : g(n), es(0) {}
size_t size() const {
return g.size();
}
void add_directed_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es++);
}
void add_edge(int from, int to, T cost = 1) {
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
for(int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a += padding;
b += padding;
T c = T(1);
if(weighted) cin >> c;
if(directed) add_directed_edge(a, b, c);
else add_edge(a, b, c);
}
}
inline vector< Edge< T > > &operator[](const int &k) {
return g[k];
}
inline const vector< Edge< T > > &operator[](const int &k) const {
return g[k];
}
};
template< typename T = int >
using Edges = vector< Edge< T > >;
#line 1 "structure/others/sparse-table.hpp"
/**
* @brief Sparse-Table(スパーステーブル)
*
*/
template< typename T, typename F >
struct SparseTable {
F f;
vector< vector< T > > st;
vector< int > lookup;
SparseTable() = default;
explicit SparseTable(const vector< T > &v, const F &f) : f(f) {
const int n = (int) v.size();
const int b = 32 - __builtin_clz(n);
st.assign(b, vector< T >(n));
for(int i = 0; i < v.size(); i++) {
st[0][i] = v[i];
}
for(int i = 1; i < b; i++) {
for(int j = 0; j + (1 << i) <= n; j++) {
st[i][j] = f(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
lookup.resize(v.size() + 1);
for(int i = 2; i < lookup.size(); i++) {
lookup[i] = lookup[i >> 1] + 1;
}
}
inline T fold(int l, int r) const {
int b = lookup[r - l];
return f(st[b][l], st[b][r - (1 << b)]);
}
};
template< typename T, typename F >
SparseTable< T, F > get_sparse_table(const vector< T > &v, const F &f) {
return SparseTable< T, F >(v, f);
}
#line 5 "graph/tree/rmq-lowest-common-ancestor.hpp"
/**
* @brief RMQ-Lowest-Common-Ancestor(最小共通祖先)
*
**/
template< typename T = int >
struct RMQLowestCommonAncestor : Graph< T > {
public:
using Graph< T >::Graph;
using Graph< T >::g;
using F = function< int(int, int) >;
void build(int root = 0) {
ord.reserve(g.size() * 2 - 1);
dep.reserve(g.size() * 2 - 1);
in.resize(g.size());
dfs(root, -1, 0);
vector< int > vs(g.size() * 2 - 1);
iota(begin(vs), end(vs), 0);
F f = [&](int a, int b) { return dep[a] < dep[b] ? a : b; };
st = get_sparse_table(vs, f);
}
int lca(int x, int y) const {
if(in[x] > in[y]) swap(x, y);
return x == y ? x : ord[st.fold(in[x], in[y])];
}
private:
vector< int > ord, dep, in;
SparseTable< int, F > st;
void dfs(int idx, int par, int d) {
in[idx] = (int) ord.size();
ord.emplace_back(idx);
dep.emplace_back(d);
for(auto &to : g[idx]) {
if(to != par) {
dfs(to, idx, d + 1);
ord.emplace_back(idx);
dep.emplace_back(d);
}
}
}
};
#line 6 "test/verify/aoj-grl-5-c-3.test.cpp"
int main() {
int N, Q;
cin >> N;
RMQLowestCommonAncestor< int > 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);
}
}
lca.build();
cin >> Q;
for(int i = 0; i < Q; i++) {
int u, v;
cin >> u >> v;
cout << lca.lca(u, v) << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_00.in | AC | 6 ms | 4 MB |
g++ | 01_small_00.in | AC | 6 ms | 4 MB |
g++ | 02_middle_00.in | AC | 6 ms | 4 MB |
g++ | 02_middle_01.in | AC | 6 ms | 4 MB |
g++ | 02_middle_02.in | AC | 6 ms | 4 MB |
g++ | 02_middle_03.in | AC | 6 ms | 4 MB |
g++ | 03_corner_00.in | AC | 6 ms | 4 MB |
g++ | 03_corner_01.in | AC | 6 ms | 4 MB |
g++ | 04_rand_00.in | AC | 6 ms | 4 MB |
g++ | 04_rand_01.in | AC | 6 ms | 4 MB |
g++ | 04_rand_02.in | AC | 6 ms | 4 MB |
g++ | 04_rand_03.in | AC | 6 ms | 4 MB |
g++ | 04_rand_04.in | AC | 6 ms | 4 MB |
g++ | 04_rand_05.in | AC | 6 ms | 4 MB |
g++ | 04_rand_06.in | AC | 6 ms | 4 MB |
g++ | 04_rand_07.in | AC | 6 ms | 4 MB |
g++ | 05_complete_00.in | AC | 6 ms | 4 MB |
g++ | 05_complete_01.in | AC | 6 ms | 4 MB |
g++ | 05_complete_02.in | AC | 6 ms | 4 MB |
g++ | 05_complete_03.in | AC | 6 ms | 4 MB |
g++ | 05_complete_04.in | AC | 6 ms | 4 MB |
g++ | 05_complete_05.in | AC | 8 ms | 5 MB |
g++ | 05_complete_06.in | AC | 10 ms | 6 MB |
g++ | 05_complete_07.in | AC | 26 ms | 16 MB |
g++ | 06_biased_00.in | AC | 23 ms | 7 MB |
g++ | 06_biased_01.in | AC | 67 ms | 37 MB |
g++ | 06_biased_02.in | AC | 67 ms | 28 MB |
g++ | 06_biased_03.in | AC | 61 ms | 33 MB |
g++ | 07_large_00.in | AC | 64 ms | 29 MB |
g++ | 07_large_01.in | AC | 66 ms | 29 MB |
g++ | 07_large_02.in | AC | 69 ms | 28 MB |
g++ | 07_large_03.in | AC | 67 ms | 28 MB |
clang++ | 00_sample_00.in | AC | 6 ms | 4 MB |
clang++ | 01_small_00.in | AC | 6 ms | 4 MB |
clang++ | 02_middle_00.in | AC | 6 ms | 4 MB |
clang++ | 02_middle_01.in | AC | 6 ms | 4 MB |
clang++ | 02_middle_02.in | AC | 6 ms | 4 MB |
clang++ | 02_middle_03.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_00.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_01.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_00.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_01.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_02.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_03.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_04.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_05.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_06.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_07.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_00.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_01.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_02.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_03.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_04.in | AC | 6 ms | 4 MB |
clang++ | 05_complete_05.in | AC | 8 ms | 4 MB |
clang++ | 05_complete_06.in | AC | 10 ms | 6 MB |
clang++ | 05_complete_07.in | AC | 26 ms | 16 MB |
clang++ | 06_biased_00.in | AC | 22 ms | 7 MB |
clang++ | 06_biased_01.in | AC | 67 ms | 37 MB |
clang++ | 06_biased_02.in | AC | 67 ms | 28 MB |
clang++ | 06_biased_03.in | AC | 62 ms | 33 MB |
clang++ | 07_large_00.in | AC | 65 ms | 29 MB |
clang++ | 07_large_01.in | AC | 66 ms | 29 MB |
clang++ | 07_large_02.in | AC | 71 ms | 28 MB |
clang++ | 07_large_03.in | AC | 70 ms | 28 MB |