/*
ID: varunra2
LANG: C++
TASK: werewolf
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
int n, m, q;
const int bits = 20;
struct BIT {
VI bit;
int n;
void init(int _n) {
n = _n;
bit.resize(n + 1);
}
void upd(int ind) {
ind++;
while (ind <= n) {
bit[ind]++;
ind += (ind & -ind);
}
}
int qry(int ind) {
int ret = 0;
ind++;
while (ind >= 1) {
ret += bit[ind];
ind -= (ind & (-ind));
}
return ret;
}
int qry(int l, int r) { return qry(r) - qry(l - 1); }
} sweep;
struct dsu {
VI par;
VI siz;
VI treepar;
void init(int n) {
par.resize(n);
treepar.resize(n);
iota(all(par), 0);
iota(all(treepar), 0);
}
int find(int x) {
if (x != par[x]) return par[x] = find(par[x]);
return x;
}
bool same(int x, int y) { return find(x) == find(y); }
bool merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
// ok so how are we going to calculate treepar
treepar[y] = x;
par[y] = x;
return true;
}
};
struct tree {
VII edgs;
dsu dsu1;
VI par;
VVI lca;
int root;
VVI child;
vector<bool> seen;
VI sub;
VI l;
VI r;
VI ord;
int time = 0;
void genchild() {
for (int i = 0; i < m; i++) {
int u = edgs[i].x;
int v = edgs[i].y;
dsu1.merge(u, v);
}
for (int i = 0; i < n; i++) {
if (dsu1.treepar[i] == i) continue;
child[dsu1.treepar[i]].PB(i);
}
}
void dfslca(int u, int v) {
lca[u][0] = v;
for (int i = 1; i < bits; i++) {
int to = lca[u][i - 1];
if (to == -1)
lca[u][i] = -1;
else
lca[u][i] = lca[to][i - 1];
}
for (auto& x : child[u]) {
dfslca(x, u);
}
}
void dfsord(int u, int v) {
sub[u] = 1;
l[u] = sz(ord);
ord.PB(u);
for (auto& x : child[u]) {
dfsord(x, u);
sub[u] += sub[x];
}
r[u] = l[u] + sub[u] - 1;
}
void genLCA() {
root = edgs.back().x;
dfslca(root, -1);
}
void genOrd() { dfsord(root, -1); }
void init(int n, VII _edgs) {
edgs = _edgs;
dsu1.init(n);
lca.resize(n);
par.assign(n, -1);
seen.assign(n, false);
child.resize(n);
sub.resize(n);
l.resize(n);
r.resize(n);
for (int i = 0; i < n; i++) {
lca[i].resize(bits);
}
genchild();
genLCA();
genOrd();
}
} human, wolf;
VI check_validity(int _n, VI x, VI y, VI s, VI e, VI l, VI r) {
n = _n;
q = sz(s);
m = sz(x);
VII edghu(m), edgwo(m);
for (int i = 0; i < m; i++) {
int u = x[i];
int v = y[i];
if (u > v) swap(u, v);
edghu[i] = MP(u, v);
edgwo[i] = MP(v, u);
}
sort(all(edghu));
reverse(all(edghu));
sort(all(edgwo));
human.init(n, edghu);
wolf.init(n, edgwo);
VI l1(q), r1(q);
VI l2(q), r2(q);
VI ret(q, 0);
VII qrys(q, MP(0, 0));
for (int i = 0; i < q; i++) {
// for human get the last ancestor of s[i] that is >= l[i]
int u = s[i], v = e[i];
int ll = l[i], rr = r[i];
// first we will do human
for (int j = bits - 1; j >= 0; j--) {
int to = human.lca[u][j];
if (to == -1) continue;
if (to >= ll) u = to;
}
for (int j = bits - 1; j >= 0; j--) {
int to = wolf.lca[v][j];
if (to == -1) continue;
if (to <= rr) v = to;
}
// so the ancestor for the human tree is u
// so the ancestor for the wolf tree is v
if (s[i] < ll or e[i] > rr) ret[i] = -1;
l1[i] = human.l[u];
r1[i] = human.r[u];
l2[i] = wolf.l[v];
r2[i] = wolf.r[v];
}
// now we need to relabel the nodes
VI perm1(n); // holds what index each node is at
for (int i = 0; i < n; i++) {
perm1[human.ord[i]] = i;
}
VI perm2(n);
for (int i = 0; i < n; i++) {
perm2[perm1[wolf.ord[i]]] = i;
}
// now we need to make the sweep stuff
VVI events;
// we have three types of events
// a) insert an element
// b) first query of a range
// store: time, type, qry idx, left bound, right bound
// c) second query of a range after you have inserted elements into range
// store: time, type, qry idx, left bound, right bound
// first we will add all the updates;
for (int i = 0; i < n; i++) {
VI cur;
cur = {i, 0};
events.PB(cur);
}
for (int i = 0; i < q; i++) {
VI cur1;
VI cur2;
cur1 = {l1[i] - 1, 1, i, l2[i], r2[i]};
cur2 = {r1[i], 2, i, l2[i], r2[i]};
events.PB(cur1);
events.PB(cur2);
}
sort(all(events));
sweep.init(n);
for (auto& x : events) {
int type = x[1];
if (type == 0) {
sweep.upd(perm2[x[0]]);
}
if (type == 1) {
qrys[x[2]].x = sweep.qry(x[3], x[4]);
}
if (type == 2) {
qrys[x[2]].y = sweep.qry(x[3], x[4]);
}
}
for (int i = 0; i < q; i++) {
if (ret[i] == -1) {
ret[i] = 0;
continue;
}
if (qrys[i].y > qrys[i].x)
ret[i] = 1;
else
ret[i] = 0;
}
return ret;
}
