HEOI2014 大工程

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>

#define maxn 5000005
#define INF 0x3f3f3f3f

using namespace std;

inline long long getint()
{
    long long num=0,flag=1;char c;
    while((c=getchar())<‘0‘||c>‘9‘)if(c==‘-‘)flag=-1;
    while(c>=‘0‘&&c<=‘9‘)num=num*10+c-48,c=getchar();
    return num*flag;
}

int n,m,N;
int fir[maxn],nxt[maxn],to[maxn],cnt;
int fa[maxn],dpt[maxn],tp[maxn],sz[maxn],son[maxn];
int In[maxn],Out[maxn],cur,tot;
long long h[maxn];
long long f[maxn],g[maxn];
int stk[maxn],top;
int P[maxn];
vector<int>G[maxn];
long long ans1,ans2,ans3;
inline bool cmp(int x,int y){return In[x]<In[y];}

inline void newnode(int u,int v)
{to[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

inline void dfs1(int u)
{
    sz[u]=1;
    for(int i=fir[u];i;i=nxt[i])
        if(to[i]!=fa[u])
        {
            dpt[to[i]]=dpt[u]+1,fa[to[i]]=u;
            dfs1(to[i]);
            sz[u]+=sz[to[i]];if(sz[to[i]]>sz[son[u]])son[u]=to[i];
        }
}

inline void dfs2(int u,int ac)
{
    In[u]=++cur,tp[u]=ac;
    if(son[u])dfs2(son[u],ac);
    for(int i=fir[u];i;i=nxt[i])if(to[i]!=fa[u]&&to[i]!=son[u])dfs2(to[i],to[i]);
    Out[u]=cur;
}

inline int LCA(int u,int v)
{
    while(tp[u]!=tp[v])
    {
        if(dpt[tp[u]]<dpt[tp[v]])swap(u,v);
        u=fa[tp[u]];
    }
    return dpt[u]<dpt[v]?u:v;
}

inline void dp(int u)
{
    sz[u]=P[u],f[u]=0,g[u]=P[u]?0:INF;
    for(int i=G[u].size()-1;~i;i--)
    {
        int v=G[u][i],w=dpt[v]-dpt[u];
        dp(v);
        if(sz[u]>0)ans1=max(ans1,f[u]+w+f[v]),ans2=min(ans2,g[u]+w+g[v]);
        ans3+=w*(1ll*sz[v]*(N-sz[v]));
        f[u]=max(f[u],w+f[v]);
        g[u]=min(g[u],w+g[v]);
        sz[u]+=sz[v];
    }
    P[u]=0;G[u].clear();
}

inline void solve()
{
    int K=N=getint();top=0;
    for(int i=1;i<=K;i++)P[h[i]=getint()]=1;h[++K]=1;
    sort(h+1,h+K+1,cmp);
    for(int i=K-1;i;i--)h[++K]=LCA(h[i],h[i+1]);
    sort(h+1,h+K+1,cmp);K=unique(h+1,h+K+1)-h-1;
    stk[++top]=1;
    for(int i=2;i<=K;i++)
    {
        while(top&&Out[stk[top]]<In[h[i]])top--;
        if(top)G[stk[top]].push_back(h[i]);
        stk[++top]=h[i];
    }
    ans1=ans3=0,ans2=INF;
    dp(1);
    printf("%lld %lld %lld\n",ans3,ans2,ans1);
    for(int i=1;i<=K;i++)sz[i]=0;
}

int main()
{
    n=getint();
    for(int i=1;i<n;i++)
    {
        int u=getint(),v=getint();
        newnode(u,v),newnode(v,u);
    }
    dfs1(1),dfs2(1,1);memset(sz,0,sizeof sz);
    m=getint();
    while(m--)solve();
}