官方正解给的是线段树+并查集,好毒瘤呀!写的我心神俱疲呀orz
我是每个节点维护左边K个点和右边K个点的连通性,还有连通块的个数。然后每次合并两个节点的时候,就暴力枚举K^2条边来并查集维护。再更新对结果的l和r。然后每次查询的时候就直接合并logn个节点即可。当节点的区间长度不足k时太毒瘤啦!【我写的简直太丑了】复杂度
O(nlognk2+qlognk2)
O
(
n
l
o
g
n
k
2
+
q
l
o
g
n
k
2
)
upd:写了一下lct的做法,大概就是离线做,把询问按r从小到大排序,把边也按y从小到大排序,维护<=r的边的以x为权值的最大生成树,每次答案就是r-l+1-边数,我们用树状数组来查询>=l的边的数量。复杂度应该是 O(qlog(n+m)) O ( q l o g ( n + m ) ) ,不过跑的比线段树+并查集还慢【再见】
upd:附上sbw巨佬的pj组做法orz:portal
线段树+并查集
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,K,m,fa[N];
bool e[N][6];
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
struct node{
int l[6],r[6],tot,R,L;
node(){memset(l,0,sizeof(l));memset(r,0,sizeof(r));}
friend node operator+(node a,node b){
node res;res.tot=a.tot+b.tot;res.R=b.R;res.L=a.L;
int lena=a.R-a.L+1,lenb=b.R-b.L+1;
for(int i=1;i<=K;++i)
fa[a.l[i]]=a.l[i],fa[a.r[i]]=a.r[i],fa[b.l[i]]=b.l[i],fa[b.r[i]]=b.r[i];
if(lena<K&&lenb<K){
for(int i=1;i<=lena;++i){
int x=a.L+i-1;
for(int j=1;j<=lenb;++j){
int y=b.L+j-1;
if(y-x>K) break;
if(!e[x][y-x]) continue;
int xx=find(a.r[i]),yy=find(b.l[j]);
if(xx!=yy) fa[xx]=yy,--res.tot;
}
}for(int i=1;i<=lena;++i) res.l[i]=find(a.l[i]);
for(int i=1;i+lena<=K&&i<=lenb;++i) res.l[i+lena]=find(b.l[i]);
int mx=min(lena+lenb,K);
for(int i=lenb;i>=1;--i) res.r[mx--]=find(b.r[i]);
for(int i=lena;i>=1&&mx;--i) res.r[mx--]=find(a.r[i]);return res;
}if(lena<K){
for(int i=1;i<=lena;++i){
int x=a.L+i-1;
for(int j=1;j<=K;++j){
int y=b.L+j-1;
if(y-x>K) break;
if(!e[x][y-x]) continue;
int xx=find(a.r[i]),yy=find(b.l[j]);
if(xx!=yy) fa[xx]=yy,--res.tot;
}
}for(int i=1;i<=lena;++i) res.l[i]=find(a.l[i]);
for(int i=1;i+lena<=K;++i) res.l[i+lena]=find(b.l[i]);
for(int i=1;i<=K;++i) res.r[i]=find(b.r[i]);return res;
}if(lenb<K){
for(int i=1;i<=K;++i){
int x=a.R-(K-i);
for(int j=1;j<=lenb;++j){
int y=b.L+j-1;
if(y-x>K) break;
if(!e[x][y-x]) continue;
int xx=find(a.r[i]),yy=find(b.l[j]);
if(xx!=yy) fa[xx]=yy,--res.tot;
}
}for(int i=1;i<=K;++i) res.l[i]=find(a.l[i]);int mx=K;
for(int i=lenb;i>=1;--i) res.r[mx--]=find(b.r[i]);
for(int i=K;i>=1&&mx;--i) res.r[mx--]=find(a.r[i]);return res;
}for(int i=1;i<=K;++i){
int x=a.R-(K-i);
for(int j=1;j<=K;++j){
int y=b.L+j-1;
if(y-x>K) break;
if(!e[x][y-x]) continue;
int xx=find(a.r[i]),yy=find(b.l[j]);
if(xx!=yy) fa[xx]=yy,--res.tot;
}
}for(int i=1;i<=K;++i) res.l[i]=find(a.l[i]),res.r[i]=find(b.r[i]);
return res;
}
}tr[N<<2];
inline void build(int p,int l,int r){
if(l==r){tr[p].l[1]=tr[p].r[1]=l;tr[p].tot=1;tr[p].L=l;tr[p].R=r;return;}
int mid=l+r>>1;
build(p<<1,l,mid);build(p<<1|1,mid+1,r);
tr[p]=tr[p<<1]+tr[p<<1|1];
}
inline node ask(int p,int l,int r,int x,int y){
if(x<=l&&r<=y) return tr[p];
int mid=l+r>>1;
if(y<=mid) return ask(p<<1,l,mid,x,y);
if(x>mid) return ask(p<<1|1,mid+1,r,x,y);
return ask(p<<1,l,mid,x,mid)+ask(p<<1|1,mid+1,r,mid+1,y);
}
int main(){
// freopen("a.in","r",stdin);
n=read();K=read();m=read();
while(m--){
int x=read(),y=read();if(x>y) swap(x,y);e[x][y-x]=1;
}build(1,1,n);m=read();
while(m--){
int l=read(),r=read();
printf("%d\n",ask(1,1,n,l,r).tot);
}return 0;
}
lct+树状数组
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define M 500010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,K,m,c[N+M][2],v[N+M],fa[N+M],mn[N+M],ans[N],cc[N],q[N];
bool rev[N+M];
struct edge{
int x,y;
}e[M];
inline bool cmp(edge a,edge b){return a.y<b.y;}
struct query{
int l,r,id;
friend bool operator<(query a,query b){return a.r<b.r;}
}qq[N];
inline void add(int x,int val){for(;x<=n;x+=x&-x) cc[x]+=val;}
inline int ask(int x){int res=0;for(;x;x-=x&-x) res+=cc[x];return res;}
inline bool isroot(int x){return x!=c[fa[x]][0]&&x!=c[fa[x]][1];}
inline void update(int p){
int l=c[p][0],r=c[p][1];mn[p]=p;
if(v[mn[l]]<v[mn[p]]) mn[p]=mn[l];
if(v[mn[r]]<v[mn[p]]) mn[p]=mn[r];
}
inline void pushdown(int p){
if(!rev[p]) return;rev[p]=0;swap(c[p][0],c[p][1]);
rev[c[p][0]]^=1;rev[c[p][1]]^=1;
}
inline void rotate(int x){
int y=fa[x],z=fa[y],l=x==c[y][1],r=l^1;
if(!isroot(y)) c[z][y==c[z][1]]=x;
fa[c[x][r]]=y;fa[y]=x;fa[x]=z;
c[y][l]=c[x][r];c[x][r]=y;update(y);update(x);
}
inline void splay(int x){
int top=0;q[++top]=x;
for(int xx=x;!isroot(xx);xx=fa[xx]) q[++top]=fa[xx];
while(top) pushdown(q[top--]);
while(!isroot(x)){
int y=fa[x],z=fa[y];
if(!isroot(y)){
if(x==c[y][1]^y==c[z][1]) rotate(x);
else rotate(y);
}rotate(x);
}
}
inline void access(int x){
int y=0;while(x){splay(x);c[x][1]=y;update(x);y=x;x=fa[x];}
}
inline void makeroot(int x){
access(x);splay(x);rev[x]^=1;
}
inline int find(int x){
access(x);splay(x);while(c[x][0]) x=c[x][0];return x;
}
inline void link(int x,int y){
makeroot(x);fa[x]=y;
}
inline void cut(int x,int y){
makeroot(x);access(y);splay(y);c[y][0]=fa[x]=0;update(y);
}
inline int qmin(int x,int y){
makeroot(x);access(y);splay(y);return mn[y];
}
inline void ins(int id){
int x=e[id].x,y=e[id].y;
if(find(x)!=find(y)){link(x,id+n),link(id+n,y),add(n-x+1,1);return;}
int z=qmin(x,y);if(v[z]>=v[id+n]) return;
cut(z,e[z-n].x);cut(z,e[z-n].y);add(n-v[z]+1,-1);
link(x,id+n);link(id+n,y);add(n-x+1,1);
}
int main(){
// freopen("a.in","r",stdin);
n=read();K=read();m=read();v[0]=inf;
for(int i=1;i<=m;++i){
e[i].x=read();e[i].y=read();if(e[i].x>e[i].y) swap(e[i].x,e[i].y);
}sort(e+1,e+m+1,cmp);int Q=read();
for(int i=1;i<=m;++i) v[i+n]=e[i].x;
for(int i=1;i<=n;++i) v[i]=inf;
for(int i=1;i<=Q;++i) qq[i].l=read(),qq[i].r=read(),qq[i].id=i;
sort(qq+1,qq+Q+1);int now=1;
for(int i=1;i<=Q;++i){
while(now<=m&&e[now].y<=qq[i].r) ins(now),++now;
ans[qq[i].id]=qq[i].r-qq[i].l+1-ask(n-qq[i].l+1);
}for(int i=1;i<=Q;++i) printf("%d\n",ans[i]);
return 0;
}
sbw巨佬的pj组做法orz
#include <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;
const int MAXN=111111;
const int MAXK=7;
int N, K, M, Qcnt;
bool Ced[MAXN][MAXK];
bool Used[MAXN][MAXK];
int Cnt1[MAXN], Cnt2[MAXN];
int F[MAXN];
int read(){
int x=0, f=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-') f=-f;ch=getchar();}
while(ch>='0' && ch<='9'){x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
int Find(int a){
if(F[F[a]]!=F[a]) F[a]=Find(F[a]);
return F[a];
}
int main(){
N=read();K=read();
M=read();
for(int i=1, a, b;i<=M;++i){
a=read();b=read();
if(a>b) swap(a, b);
Ced[a][b-a]=true;
}
for(int i=1;i<=N;++i) F[i]=i;
for(int i=1;i<=K;++i){
for(int j=1, fx, fy;j<=N;++j){
if(!Ced[j][i]) continue;
fx=Find(j);fy=Find(j+i);
if(fx!=fy){
Used[j][i]=true;
F[fx]=fy;
}
}
}
for(int i=1;i<=N;++i)
for(int j=1;j<=K;++j){
if(Used[i][j]){
++Cnt1[i+j];
++Cnt2[i];
}
}
for(int i=1;i<=N;++i){
Cnt1[i]+=Cnt1[i-1];Cnt2[i]+=Cnt2[i-1];
}
//for(int i=1;i<=N;++i){
// cout << Cnt1[i] << " " << Cnt2[i] << endl;
//}
int Del=0;
Qcnt=read();
for(int a, b;Qcnt--;){
Del=0;
a=read();b=read();
for(int i=a-1;i+K>b;--i)
for(int k=K;i+k>b;--k)
if(Used[i][k]) ++Del;
//cout << (b-a+1)-(Cnt1[b]-Cnt2[a-1])-Del << endl;
printf("%d\n", (b-a+1)-(Cnt1[b]-Cnt2[a-1])-Del);
}
return 0;
}