#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "werewolf.h"
namespace TEST2 {
int n;
VVI gp;
void dfs(int u, VI& vis, int mn, int mx) {
vis[u] = true;
for (int v : gp[u]) if (!vis[v]) {
if (mn <= v && v <= mx) {
dfs(v, vis, mn, mx);
}
}
}
VI solve(int N, VI X, VI Y, VI S, VI E, VI L, VI R) {
n = N;
gp = VVI(n);
rep(i, X.size()) {
gp[X[i]].pb(Y[i]);
gp[Y[i]].pb(X[i]);
}
VI ansret;
rep(i, S.size()) {
auto[s, e, l, r] = make_tuple(S[i], E[i], L[i], R[i]);
VI visa, visb;
visa = visb = VI(n);
dfs(s, visa, l, +2e9);
dfs(e, visb, -2e9, r);
bool ans = false;
rep(u, n) if (visa[u] && visb[u]) ans = true;
ansret.pb(ans);
}
return ansret;
}
}
struct DSU {
int n;
VI par;
DSU(){}
DSU(int n_arg) : n(n_arg) {
par = VI(n);
rep(u, n) par[u] = u;
}
int get(int u) {
return u == par[u] ? u : (par[u] = get(par[u]));
}
bool onion(int u, int v) {
u = get(u);
v = get(v);
if (u == v) return false;
par[v] = u;
return true;
}
} dsu;
struct COMPTREE {
int n;
VVI par;
VVI gp;
VI tin, tout;
VI euler;
int tc;
COMPTREE(){}
COMPTREE(int n_arg) : n(n_arg) {
par = VVI(n, VI(20, -1));
gp = VVI(n);
tin = tout = VI(n);
}
void dfs(int u) {
euler.pb(u);
tin[u] = tc++;
for (int v : gp[u]) dfs(v);
tout[u] = tc-1;
}
void init() {
replr(i, 1, 19) rep(u, n) par[u][i] = par[par[u][i-1]][i-1];
int root;
rep(u, n) {
if (par[u][0] == u) root = u;
else gp[par[u][0]].pb(u);
}
tc = 0;
dfs(root);
}
int lift(int u, int L, int R) {
reprl(i, 19, 0) if (L <= par[u][i] && par[u][i] <= R) u = par[u][i];
return u;
}
void print() {
rep(u, n) cout << u << "'s parent: " << par[u][0] << endl;
for (int u : euler) cout << u << " "; cout << endl;
}
void print(int u) {
replr(i, tin[u], tout[u]) cout << euler[i] << " ";
cout << endl;
}
} lwp, hgp;
struct QUERY {
int ind;
int al, ar;
int bl, br;
};
bool operator<(const QUERY& a, const QUERY& b) {
return a.ar < b.ar;
}
struct SEGTREE {
int n;
VI tree;
SEGTREE(int sz) {
n = 1;
while (n < sz) n *= 2;
tree = VI(2*n, -1);
}
void set(int N, int L, int R, int i, int s) {
if (i < L || i > R) return;
if (L == R) {
tree[N] = s;
return;
}
int M = (L + R) / 2;
set(2*N+1, L, M, i, s);
set(2*N+2, M+1, R, i, s);
tree[N] = max(tree[2*N+1], tree[2*N+2]);
}
int get(int N, int L, int R, int l, int r) {
if (l <= L && R <= r) return tree[N];
if (R < l || L > r) return -1;
int M = (L + R) / 2;
return max(get(2*N+1, L, M, l, r), get(2*N+2, M+1, R, l, r));
}
void set(int i, int s) {
set(0, 0, n-1, i, s);
}
int get(int l, int r) {
return get(0, 0, n-1, l, r);
}
};
VI check_validity(int N, VI X, VI Y, VI S, VI E, VI L, VI R) {
int n = N;
VVI gp(n);
rep(i, X.size()) {
gp[X[i]].pb(Y[i]);
gp[Y[i]].pb(X[i]);
}
lwp = hgp = COMPTREE(n);
dsu = DSU(n);
replr(u, 0, n-1) for (int v : gp[u]) if (v < u) {
if (dsu.onion(u, v = dsu.get(v))) lwp.par[v][0] = u;
}
lwp.par[n-1][0] = n-1;
lwp.init();
dsu = DSU(n);
reprl(u, n-1, 0) for (int v : gp[u]) if (v > u) {
if (dsu.onion(u, v = dsu.get(v))) hgp.par[v][0] = u;
}
hgp.par[0][0] = 0;
hgp.init();
VI a = hgp.euler;
VI aind = hgp.tin;
VI b = lwp.euler;
VI bind = lwp.tin;
vector<QUERY> qrs;
rep(i, S.size()) {
int u = hgp.lift(S[i], L[i], +2e9);
int v = lwp.lift(E[i], -2e9, R[i]);
qrs.pb({i, hgp.tin[u], hgp.tout[u], lwp.tin[v], lwp.tout[v]});
}
sort(all(qrs));
int ptr = 0;
SEGTREE ds(n);
VI ans(S.size());
for (auto[ind, al, ar, bl, br] : qrs) {
while (ptr <= ar) ds.set(bind[a[ptr]], ptr), ptr++;
ans[ind] = (ds.get(bl, br) >= al);
}
return ans;
}
