#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5 + 5;
vector<int> graph[maxn];
int vis[maxn][2], val[maxn], timer = 1, pos[maxn], log_dp[maxn];
pair<int, int> T[maxn+5][21];
void dfs(int u, int p) {
pos[u] = timer; val[timer++] = u;
for(int &v : graph[u]) if(v != p) dfs(v, u);
}
pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
return { min(a.first, b.first), max(a.second, b.second) };
}
pair<int, int> query(int l, int r) {
int k = log_dp[r-l+1];
return merge(T[l][k], T[r-(1<<k)+1][k]);
}
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
int Q = S.size(), M = X.size();
vector<int> ans(Q);
for(int i=0; i<M; i++) {
X[i]++; Y[i]++;
graph[X[i]].push_back(Y[i]);
graph[Y[i]].push_back(X[i]);
}
int mx = 0;
for(int i=1; i<=N; i++) mx = max(mx, (int)graph[i].size());
if(M == N - 1 && mx <= 2) {
for(int i=1; i<=N; i++) {
if(graph[i].size() == 1) {
dfs(i, i);
break;
}
}
for(int i=2; i<=N; i++) log_dp[i] = log_dp[i/2] + 1;
for(int i=1; i<=N; i++) T[i][0] = { val[i], val[i] };
for(int j=1; j<21; j++)
for(int i=1; i+(1<<j)-1<=N; i++) T[i][j] = merge(T[i][j-1], T[i+(1<<(j-1))][j-1]);
for(int i=0; i<Q; i++) {
if(S[i] < L[i]) continue;
if(E[i] > R[i]) continue;
S[i]++; E[i]++; L[i]++; R[i]++;
pair<int, int> A = { pos[S[i]], pos[S[i]] };
pair<int, int> B = { pos[E[i]], pos[E[i]] };
int l=pos[S[i]], r=N;
while(l <= r) {
int mid = (l + r) / 2;
if(query(pos[S[i]], mid).first >= L[i]) A.second = mid, l = mid + 1;
else r = mid - 1;
}
l=1, r=pos[S[i]];
while(l <= r) {
int mid = (l + r) / 2;
if(query(mid, pos[S[i]]).first >= L[i]) A.first = mid, r = mid - 1;
else l = mid + 1;
}
l=pos[E[i]], r=N;
while(l <= r) {
int mid = (l + r) / 2;
if(query(pos[E[i]], mid).second <= R[i]) B.second = mid, l = mid + 1;
else r = mid - 1;
}
l=1, r=pos[E[i]];
while(l <= r) {
int mid = (l + r) / 2;
if(query(mid, pos[E[i]]).second <= R[i]) B.first = mid, r = mid - 1;
else l = mid + 1;
}
if(min(A.second, B.second) - max(A.first, B.first) >= 0) ans[i] = 1;
}
return ans;
}
for(int i=0; i<Q; i++) {
S[i]++; E[i]++; L[i]++; R[i]++;
queue<pair<int, int> > q;
memset(vis, 0, sizeof(vis));
q.push({ S[i], 0 });
vis[S[i]][0] = 1;
while(!q.empty()) {
auto [u, t] = q.front(); q.pop();
if(t == 0) {
if(u >= L[i] && u <= R[i] && !vis[u][1]) {
vis[u][1] = 1;
q.push({ u, 1 });
}
}
for(int &v : graph[u]) {
if(vis[v][t]) continue;
if(t == 0 && v < L[i]) continue;
if(t == 1 && v > R[i]) continue;
vis[v][t] = 1; q.push({ v, t });
}
}
ans[i] = vis[E[i]][1];
}
return ans;
}
