#include "werewolf.h"
#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
int l,r;
bitset<200010> vh,vw;
vector<vi> G;
void dfs_human(int u){
if(u<l) return;
vh[u]=1;
for(auto &v:G[u]){
if(!vh[v]){
dfs_human(v);
}
}
}
void dfs_wolf(int u){
if(u>r) return;
vw[u]=1;
for(auto &v:G[u]){
if(!vw[v]){
dfs_wolf(v);
}
}
}
map<int,int> m,mtr;
vector<int> path;
int vis[800010];
ii tree[800010];
void dfs(int u){
path.push_back(u);
vis[u]=1;
for(auto &v: G[u]){
if(!vis[v]){
dfs(v);
}
}
}
int le[800010],base;
void init(int node,int a,int b){
if(a==b){
tree[node]=ii(path[a],path[a]);
return;
}
int mid=(a+b)/2;
init(2*node+1,a,mid);
init(2*node+2,mid+1,b);
tree[node].first=min(tree[2*node+1].first,tree[2*node+2].first);
tree[node].second=max(tree[2*node+1].second,tree[2*node+2].second);
}
int query_ma(int node,int a,int b,int l,int r){
if(a>r or b<l) return -MAX;
if(l<=a and r>=b){
return tree[node].second;
}
int mid=(a+b)/2;
return max(query_ma(2*node+1,a,mid,l,r),query_ma(2*node+2,mid+1,b,l,r));
}
int query_min(int node,int a,int b,int l,int r){
if(a>r or b<l) return MAX;
if(l<=a and r>=b){
return tree[node].first;
}
int mid=(a+b)/2;
return min(query_min(2*node+1,a,mid,l,r),query_min(2*node+2,mid+1,b,l,r));
}
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
std::vector<int> S, std::vector<int> E,
std::vector<int> L, std::vector<int> R) {
G.resize(N+1);
for(int i=0;i<X.size();i++){
int u=X[i],v=Y[i];
G[u].push_back(v);
G[v].push_back(u);
}
bool sw=0;
int id=-1;
for(int i=0;i<N;i++){
if(G[i].size()>2){
sw=1;
}
if(G[i].size()==1 and id==-1) id=i;
}
vector<int> res;
if(sw==1){
for(int i=0;i<S.size();i++){
l=L[i];
r=R[i];
vh.reset();
vw.reset();
dfs_human(S[i]);
dfs_wolf(E[i]);
bool sw=0;
for(int i=0;i<N;i++){
if(vh[i]==1 and vw[i]==1){
sw=1;
break;
}
}
res.push_back(sw);
}
}
else{
dfs(id);
for(int i=0;i<path.size();i++){
m[path[i]]=i;
}
init(0,0,N-1);
for(int i=0;i<S.size();i++){
int l=m[S[i]],r=m[E[i]];
if(l>r){
swap(r,l);
int st=l,en=r;
r++;
while(r-l>1){
// cout<<l<<" "<<r<<endl;
int mid=(r+l)/2;
if(query_ma(0,0,N-1,st,mid)<=R[i]){
l=mid;
}
else r=mid;
}
/// cout<<l<<endl;
//l true
if(query_min(0,0,N-1,l,en)>=L[i]) res.push_back(1);
else res.push_back(0);
}
else{
int st=l,en=r;
r++;
while(r-l>1){
int mid=(r+l)/2;
if(query_min(0,0,N-1,st,mid)>=L[i]){
l=mid;
}
else r=mid;
}
//l true
if(query_ma(0,0,N-1,l,en)<=R[i]) res.push_back(1);
else res.push_back(0);
}
}
}
return res;
}
