虚树+树形dp P2495

1.如果发现树形dp有许多无用点，可以考虑建立虚树，保留关键点与关键点LCA，在虚树上DP，当然，需要在DP构成中维护前向星，用memset会TLE，并且必须遍历到所有虚树节点，不然前向星不会刷新

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n , m;
//前向星
int head[300005] , cnt;
int xs_head[300005], xs_cnt;
struct node{
    int t, next;
    ll w;
}edge[600005], xs_edge[600005];
void add(int f, int t, ll w)
{
    edge[cnt].t = t;
    edge[cnt].w = w;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
void xs_add(int f ,int t, ll w)
{
    xs_edge[xs_cnt].t = t;
    xs_edge[xs_cnt].w = w;
    xs_edge[xs_cnt].next = xs_head[f];
    xs_head[f] = xs_cnt ++;
}
//LCA
int dep[300005], bz[300005][30];
ll nw[300005];
int dfn[300005], times;
void dfs(int u, int deep)
{
    dep[u] = deep;
    dfn[u] = ++ times;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        ll  w = edge[i].w;
        if(!dep[v])
        {
            nw[v] = min(nw[u], w);
            bz[v][0] = u;
            dfs(v, deep + 1);
        }
    }
}
void deal()
{
    for(int i = 1 ; i <= 20 ; i ++)
    {
        for(int j = 1 ; j <= n ; j ++)
        {
            bz[j][i] = bz[bz[j][i-1]][i-1];
        }
    }
}
int LCA(int x , int y)
{
    if(dep[x] < dep[y])
        swap(x,y);
    for(int i = 20 ; i >= 0 ; i --)
        if(dep[bz[x][i]] >= dep[y])
            x = bz[x][i];
    if(x == y) return x;
    for(int i = 20 ; i >= 0 ; i --)
        if(bz[x][i] ^ bz[y][i])
            x = bz[x][i] , y = bz[y][i];
    return bz[x][0];
}
//虚树建立
bool cmp(int x , int y)
{
    return dfn[x] < dfn[y];
}
int vertex[300005];
int st[300005], top;
void insert(int x) {
    if(top == 1) {st[++top] = x; return ;}
    int lca = LCA(x, st[top]);
    if(lca == st[top]) {st[++top] = x; return ;}
    while(top > 1 && dfn[st[top - 1]] >= dfn[lca]) {
        //cout << st[top-1] <<" "<< st[top]<< " " << nw[st[top]]<<endl;
        xs_add(st[top - 1], st[top], nw[st[top]]), top--;
    }
    if(lca != st[top]) {
        //cout << lca <<" "<< st[top]<< " " << nw[st[top]]<<endl;
        xs_add(lca, st[top], nw[st[top]]), st[top] = lca;//
    }
    st[++top] = x;
}
// dp
ll dp[300005];
int is[300005];
void dfs2(int u)
{
    dp[u] = 1ll << 60;
    ll temp = 0;
    for(int i = xs_head[u] ; i != - 1; i = xs_edge[i].next)
    {
        int v = xs_edge[i].t;
        ll w = xs_edge[i].w;
        dfs2(v);
        if(is[v])
            temp += w;
        else
            temp += min(dp[v], w);
    }
    dp[u] = min(dp[u],temp);
    xs_head[u] = -1;
}
int main(void)
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
    mem(head,-1);
    mem(xs_head,-1);
    scanf("%d", &n);
    for(int i = 1 ; i < n ; i ++)
    {
        int u ,v;
        ll w;
        scanf("%d %d %lld",&u, &v, &w);
        add(u,v,w);
        add(v,u,w);
    }
    //LCA构建
    nw[1] = 1ll << 60;
    dfs(1,1);
    deal();
    //虚树构建
    int q, k;
    scanf("%d", &q);
    while(q --)
    {
        xs_cnt = 0;
        scanf("%d" , &k);
        for(int i = 1; i <= k ; i ++)
            scanf("%d",&vertex[i]), is[vertex[i]] = 1;
        sort(vertex+1 , vertex+1+k, cmp);
        st[++ top] = 1;
        for(int i = 1 ; i <= k ; i ++)
            insert(vertex[i]);
        while(-- top) {
            //cout << st[top] <<" "<< st[top + 1]<< " " << nw[st[top + 1]]<<endl;
            xs_add(st[top], st[top + 1], nw[st[top + 1]]);
        }
        dfs2(1);
        printf("%lld\n",dp[1]);
        for(int i = 1 ; i <= k ; i ++)
            is[vertex[i]] = 0;
    }


}