bzoj5329: [Sdoi2018]战略游戏

题目
题解

Solution

问题可转化成求点集之间两两的路径并

Code

#include<bits/stdc++.h>
using namespace std;
const int N=300002,M=100002;
struct node{
	int to,ne;
}e[N<<1],E[M<<2];
int fa[N][20],dep[N],TOT,tot,x,y,q,k,st[M],low[M],dfn[M],tim,num,id[N],h[N],H[M],top,n,v[M],T,i,m,dis[N];
inline char gc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
	int x=0,fl=1;char ch=gc();
	for(;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
	for(;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
	return x*fl;
}
inline void wri(int a){if(a<0)a=-a,putchar('-');if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(int a){wri(a),puts("");}
void add(int x,int y){E[++TOT]=(node){y,H[x]},H[x]=TOT;}
void add2(int x,int y){e[++tot]=(node){y,h[x]},h[x]=tot;}
void tarjan(int u){
	low[u]=dfn[u]=++tim,st[++top]=u;
	for (int i=H[u],v;i;i=E[i].ne)
		if (!dfn[v=E[i].to]){
			tarjan(v);
			low[u]=min(low[u],low[v]);
			if (low[v]>=dfn[u]){
				num++;int x;
				do{
					x=st[top--];
					add2(x,num),add2(num,x);
				}while (x!=v);
				add2(u,num),add2(num,u);
			}
		}else low[u]=min(low[u],dfn[v]);
}
void dfs(int u,int f){
	fa[u][0]=f,id[u]=++TOT;
	for (int i=1;i<19;i++) fa[u][i]=fa[fa[u][i-1]][i-1];
	for (int i=h[u],v;i;i=e[i].ne)
		if ((v=e[i].to)!=f){
			dep[v]=dep[u]+1;
			dis[v]=dis[u]+(v<=n);
			dfs(v,u);
		}
}
int LCA(int x,int y){
	if (dep[x]<dep[y]) swap(x,y);
	for (int i=18;~i;i--)
		if (dep[fa[x][i]]>=dep[y]) x=fa[x][i];
	if (x==y) return x;
	for (int i=18;~i;i--)
		if (fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
bool cmp(int x,int y){return id[x]<id[y];}
void solve(){
	k=rd();
	for (int i=0;i<k;i++) v[i]=rd();
	sort(v,v+k,cmp);
	int ans=0,rt=v[0];
	for (int i=0;i<k;i++){
		int x=v[i],y=v[(i+1)%k],lca=LCA(x,y);
		if (dep[lca]<dep[rt]) rt=lca;
		ans+=dis[x]+dis[y]-(dis[lca]<<1);
	}
	wln((ans>>1)+(rt<=n)-k);
}
int main(){
for (T=rd();T--;){
	n=num=rd(),m=rd();
	TOT=tot=tim=top=0;
	memset(dfn,0,(n+1)<<2);
	memset(H,0,(n+1)<<2);
	memset(h,0,(n+m+1)<<2);
	for (i=1;i<=m;i++) x=rd(),y=rd(),add(x,y),add(y,x);
	tarjan(1);
	dep[0]=-1,TOT=0,dfs(1,0);
	for (q=rd();q--;) solve();
}
}