#include #include #include #include #include #define LL long long #define Re register int #define mp make_pair using namespace std; const int N=1e5+3,M=2e5+3; int x,y,l,r,n,m,T,Ans[N];char ch[20]; inline void in(Re &x){ int f=0;x=0;char c=getchar(); while(c<'0'||c>'9')f|=c=='-',c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); x=f?-x:x; } struct Union{// 冰茶姬(并查集) struct BK{int x,y,sizex,sizey;BK(Re X=0,Re S1=0,Re Y=0,Re S2=0){x=X,y=Y,sizex=S1,sizey=S2;}}; int fa[N<<1],size[N<<1];stackQ; inline int find(Re x){return fa[x]==x?x:find(fa[x]);} inline void merge(Re x,Re y){// 启发式合并 x=find(x),y=find(y); if(x==y)return; if(size[x]>size[y])swap(x,y); Q.push(BK(x,size[x],y,size[y])); fa[x]=y,size[y]+=size[x]; } inline void back(Re to){// 撤销操作 while(int(Q.size())>to){ BK a=Q.top();Q.pop(); fa[a.x]=a.x,size[a.x]=a.sizex; fa[a.y]=a.y,size[a.y]=a.sizey; } } }TF; int o,head[N<<2]; struct QAQ{int x,y,next;}a[M*20]; inline void add(Re x,Re y1,Re y2){a[++o].x=y1,a[o].y=y2,a[o].next=head[x],head[x]=o;} struct Segment_Tree{ #define pl (p<<1) #define pr (p<<1|1) #define mid ((L+R)>>1) inline void change(Re p,Re L,Re R,Re l,Re r,Re x,Re y){ if(l>r)return; if(l<=L&&R<=r){add(p,x,y);return;} if(l<=mid)change(pl,L,mid,l,r,x,y); if(r>mid)change(pr,mid+1,R,l,r,x,y); } inline void dfs(Re p,Re L,Re R){ Re tmp=TF.Q.size(); for(Re i=head[p];i;i=a[i].next){ if(TF.find(a[i].x)==TF.find(a[i].y)){ for(Re j=L;j<=R;++j)Ans[j]=1; TF.back(tmp);return; } TF.merge(a[i].x,a[i].y+n),TF.merge(a[i].x+n,a[i].y); } if(L