考虑cdq分治,solve(l,r)表示把询问区间为(l,r)的边全部删掉的状态,那么递归solve(l,mid)的时候,只需要用并查集将区间在(mid+1,r)且不在(l,mid)出现的部分并起来即可,solve(mid+1,r)时同理。
get到了一个新技能,并查集的恢复,用一个栈记录即可,具体过程简单手动模拟一下就好啦…
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
//by:MirrorGray
using namespace std;
const int N=211111;
int n,m;
int top,s[N*21];
struct ASK{int n,a[5];}q[N];
int tim,ans[N],mark[N],x[N],y[N],fa[N];
void read(int &x,char ch=0){
for(ch=getchar();ch<'0'||ch>'9';ch=getchar());
for(x=0;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
}
int find(int x){
if(fa[x]==x)return x;
s[++top]=x;s[++top]=fa[x];
return fa[x]=find(fa[x]);
}
void merge(int x,int y){
int fx=find(x),fy=find(y);
if(fx==fy)return ;
s[++top]=fx;s[++top]=fx;fa[fx]=fy;
}
void solve(int l,int r){
// cout<<l<<" "<<r<<endl;
int mid=(l+r)>>1,now=top;
if(l==r){
for(int i=0;i<q[l].n&&!ans[l];i++)if(find(x[q[l].a[i]])!=find(y[q[l].a[i]]))ans[l]=true;
while(now!=top)fa[s[top-1]]=s[top],top-=2;
return ;
}
tim++;
for(int i=l;i<=mid;i++)for(int j=0;j<q[i].n;j++)mark[q[i].a[j]]=tim;
for(int i=mid+1;i<=r;i++)for(int j=0;j<q[i].n;j++)
if(mark[q[i].a[j]]!=tim)merge(x[q[i].a[j]],y[q[i].a[j]]);
solve(l,mid);while(now!=top)fa[s[top-1]]=s[top],top-=2;
tim++;
for(int i=mid+1;i<=r;i++)for(int j=0;j<q[i].n;j++)mark[q[i].a[j]]=tim;
for(int i=l;i<=mid;i++)for(int j=0;j<q[i].n;j++)
if(mark[q[i].a[j]]!=tim)merge(x[q[i].a[j]],y[q[i].a[j]]);
solve(mid+1,r);while(now!=top)fa[s[top-1]]=s[top],top-=2;
}
int main(){
memset(mark,-1,sizeof(mark));
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)read(x[i]),read(y[i]);
int Q;scanf("%d",&Q);
for(int i=1;i<=Q;i++){
read(q[i].n);
for(int j=0;j<q[i].n;j++)read(q[i].a[j]),mark[q[i].a[j]]=0;
}
for(int i=1;i<=n;i++)fa[i]=i;
for(int i=1;i<=m;i++)if(mark[i])merge(x[i],y[i]);
solve(1,Q);
for(int i=1;i<=Q;i++)puts(ans[i]?"Disconnected":"Connected");
return 0;
}