【bzoj3611】 대공정 허수

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 1000000000
#define N 1000005
#define ll long long
using namespace std;

int n,m,tot,dfsclk,fst[N],pnt[N<<1],nxt[N<<1],bin[25],pos[N],fa[N][20],d[N];
int a[N],p[N],sz[N],f[N],g[N],len[N],anc[N],q[N]; ll sum[N]; bool bo[N];
int read(){
	int x=0; char ch=getchar();
	while (ch<'0' || ch>'9') ch=getchar();
	while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
	return x;
}
void add(int x,int y){
	pnt[++tot]=y; nxt[tot]=fst[x]; fst[x]=tot;
}
void dfs(int x){
	pos[x]=++dfsclk; int i,p;
	for (i=1; bin[i]<=d[x]; i++) fa[x][i]=fa[fa[x][i-1]][i-1];
	for (p=fst[x]; p; p=nxt[p]){
		int y=pnt[p];
		if (y!=fa[x][0]){
			fa[y][0]=x; d[y]=d[x]+1; dfs(y);
		}
	}
}
int lca(int x,int y){
	if (d[x]<d[y]) swap(x,y); int tmp=d[x]-d[y],i;
	for (i=0; bin[i]<=tmp; i++)
		if (tmp&bin[i]) x=fa[x][i];
	for (i=19; i>=0; i--)
		if (fa[x][i]!=fa[y][i]){ x=fa[x][i]; y=fa[y][i]; }
	return (x==y)?x:fa[x][0];
}
bool cmp(int x,int y){ return pos[x]<pos[y]; }
void solve(){
	m=read(); int i,tp=0,cnt=m;
	for (i=1; i<=m; i++){
		p[i]=a[i]=read();
		bo[a[i]]=1;
	}
	sort(a+1,a+m+1,cmp);
	for (i=1; i<=m; i++)
		if (!tp){ q[++tp]=a[i]; anc[a[i]]=0; } else{
			int tmp=lca(a[i],q[tp]);
			for (; d[q[tp]]>d[tmp]; tp--)
				if (d[q[tp-1]]<=d[tmp])
					anc[q[tp]]=tmp;
			if (q[tp]!=tmp){
				anc[tmp]=q[tp]; q[++tp]=tmp;
				p[++cnt]=tmp;
			}
			anc[a[i]]=tmp; q[++tp]=a[i];
		}
	sort(p+1,p+cnt+1,cmp);
	for (i=1; i<=cnt; i++){
		int x=p[i]; len[x]=d[x]-d[anc[x]];
		if (bo[x]){ sz[x]=1; f[x]=g[x]=0; }
		else{ sz[x]=0; f[x]=inf; g[x]=-inf; }
		sum[x]=0;
	}
	ll t1=0; int t2=inf,t3=-inf;
	for (i=cnt; i>1; i--){
		int x=p[i],y=anc[x];
		t1+=(sum[x]+(ll)len[x]*sz[x])*sz[y]+sum[y]*sz[x];
		sz[y]+=sz[x]; sum[y]+=sum[x]+(ll)len[x]*sz[x];
		t2=min(t2,f[y]+f[x]+len[x]); f[y]=min(f[y],f[x]+len[x]);
		t3=max(t3,g[y]+g[x]+len[x]); g[y]=max(g[y],g[x]+len[x]);
	}
	for (i=1; i<=m; i++) bo[a[i]]=0;
	printf("%lld %d %d
",t1,t2,t3);
}
int main(){
	n=read(); int i;
	bin[0]=1; for (i=1; i<=20; i++) bin[i]=bin[i-1]<<1;
	for (i=1; i<n; i++){
		int x=read(),y=read();
		add(x,y); add(y,x);
	}
	dfs(1); int cas=read(); while (cas--) solve();
	return 0;
}