洛谷P3233 [HNOI2014]世界树

虚树= =

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 0x7f7f7f7f
#define MAXN 300005
#define LOG 20
#define rint register int
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define ft first
#define sc second
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if('-'==ch)f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int fst1[MAXN],nxt1[MAXN<<1],from1[MAXN<<1],to1[MAXN<<1],cnte;
int fst[MAXN],nxt[MAXN<<1],from[MAXN<<1],to[MAXN<<1],cnt;
void add(int x,int y){
    nxt[++cnt]=fst[x],fst[x]=cnt,from[cnt]=x,to[cnt]=y;
    nxt[++cnt]=fst[y],fst[y]=cnt,from[cnt]=y,to[cnt]=x;
}
void add1(int x,int y){
    nxt1[++cnte]=fst1[x],fst1[x]=cnte,from1[cnte]=x,to1[cnte]=y;
    nxt1[++cnte]=fst1[y],fst1[y]=cnte,from1[cnte]=y,to1[cnte]=x;
}
int n,m;
int h[MAXN];
int dep[MAXN],fa[MAXN][LOG],sz[MAXN];
int dfn[MAXN],idx;
int b[MAXN],pa[MAXN];
int lca(int x,int y){
    if(dep[x]<dep[y])swap(x,y);
    for(rint d=dep[x]-dep[y],k=0;d;d>>=1,k++){
        if(d&1)x=fa[x][k];
    }
    if(x==y)return x;
    for(rint k=LOG-1;k>=0;k--){
        if(fa[x][k]!=fa[y][k]){
            x=fa[x][k],y=fa[y][k];
        }
    }
    return fa[x][0];
}
void dfs1(int x){
    sz[x]=1;
    dfn[x]=(++idx);
    for(rint e=fst1[x];e;e=nxt1[e]){
        int y=to1[e];
        if(y!=fa[x][0]){
            fa[y][0]=x;
            dep[y]=dep[x]+1;
            dfs1(y);
            sz[x]+=sz[y];
        }
    }
}
bool comp(const int &A,const int &B){
    return (dfn[A]<dfn[B]);
}
bool comp1(const int A,const int &B){
    return (dep[A]>dep[B]);
}
int sta[MAXN],top,rt,t[MAXN],tot;
pii d[MAXN];
void dfs(int x){
    for(rint e=fst[x];e;e=nxt[e]){
        int y=to[e];
        if(y!=pa[x]){
            d[y]=min(d[y],mp(d[x].ft+dep[y]-dep[x],d[x].sc));
            dfs(y);
        }
    }
}
void pop(int p){
    pa[sta[top]]=p;
    add(sta[top],p);
    b[sta[top]]=1;
    t[++tot]=sta[top];
    top--;    
}
int h1[MAXN];
void init(){
    cnt=0;
    memset(fst,0,sizeof(fst));
    memset(nxt,0,sizeof(nxt));
    memset(from,0,sizeof(from));
    memset(to,0,sizeof(to));
    memset(b,0,sizeof(b));
    memset(pa,0,sizeof(pa));
    memcpy(h1,h,sizeof(h1));
    sort(h+1,h+m+1,comp);
    top=tot=0;
    sta[++top]=h[1];
    int x,y;
    for(rint i=2;i<=m;i++){
        x=h[i],y=lca(x,sta[top]);
        while(dep[sta[top-1]]>=dep[y]){
            pop(sta[top-1]);
        }
        if(dep[sta[top]]==dep[y]){
            sta[++top]=x;
        }
        else{
            pop(y);
            sta[++top]=y;
            sta[++top]=x;
        }
    }
    while(top){
        pop(sta[top-1]);
    }
    rt=sta[1];
    for(rint i=1;i<=tot;i++)d[t[i]]=mp(INF,0);
    for(rint i=1;i<=m;i++)d[h[i]]=mp(0,h[i]);
    sort(t+1,t+tot+1,comp1);
    for(rint i=1;i<=tot;i++){
        x=t[i];
        d[pa[x]]=min(d[pa[x]],mp(d[x].ft-dep[pa[x]]+dep[x],d[x].sc));
    }
    dfs(rt);
}
int ans[MAXN];
int LA(int x,int L){
    for(rint k=L,p=0;k;k>>=1,p++){
        if(k&1){
            x=fa[x][p];
        }
    }
    return x;
}
int workup(int x,int f,int L){
    if(L<=0)return 0;
    int y=LA(x,min(L,dep[x]-dep[f]-1));
    return sz[y]-sz[x];
}
int workdown(int x,int f,int L){
    if(L<=0)return 0;
    int y=LA(x,dep[x]-dep[f]-1);
    int z=LA(x,max(dep[x]-dep[f]-1-L,0));
    return sz[y]-sz[z];
}
void work(int x,int f){
    int t=d[f].ft+d[x].ft+dep[x]-dep[f]-1;
    int L=t>>1;
    if(t&1){
        ans[d[x].sc]+=workup(x,f,L-d[x].ft);
        ans[d[f].sc]+=workdown(x,f,L-d[f].ft);
        ans[min(d[x].sc,d[f].sc)]+=workup(x,f,L+1-d[x].ft)-workup(x,f,L-d[x].ft);
    }
    else{
        ans[d[x].sc]+=workup(x,f,L-d[x].ft);
        ans[d[f].sc]+=workdown(x,f,L-d[f].ft);
    }
}
void solve(){
    memset(ans,0,sizeof(ans));
    int x;
    for(rint i=1;i<=tot;i++){
        x=t[i];
        ans[d[x].sc]+=sz[x];
        int y=LA(x,dep[x]-dep[pa[x]]-1);
        ans[d[pa[x]].sc]-=sz[y];
    }
    ans[d[rt].sc]+=sz[1]-sz[rt];
    for(rint i=1;i<=tot;i++){
        x=t[i];if(x==rt)continue;
        work(x,pa[x]);    
    }
    for(rint i=1;i<=m;i++){
        printf("%d ",ans[h1[i]]);
    }printf("\n");
}
int main()
{
//    freopen("data.in","r",stdin);
    n=read();
    int x,y;
    for(rint i=1;i<n;i++){
        x=read(),y=read();
        add1(x,y);
    }
    dep[1]=1; 
    dfs1(1);
    for(rint k=1;k<LOG;k++){
        for(rint i=1;i<=n;i++){
            fa[i][k]=fa[fa[i][k-1]][k-1];
        }
    }
    int q=read();
    while(q--){
        m=read();
        for(rint i=1;i<=m;i++)h[i]=read();
        init();
        solve();
    }
    return 0;
}