Codeforces 613D Kingdom and its Cities（虚树+树形DP）

题目链接

题意

给你一颗树多次询问，每次询问若干个节点，求最少删除几个节点使得任意两选中节点不连通，询问总共的点集不超过 $100000$

思路

先建个虚树，然后树形DP。
$dp[u][0]$ 子树上没有选中点与 $u$ 连通的最小花费
$dp[u][1]$ 子树上不超过一个选中点与 $u$ 连通的最小花费

转移方程见代码

代码

#include <bits/stdc++.h>
using namespace std;

#define ll long long

namespace shupou {
const ll N = 1000005;
const ll M = 1000005<<1;

ll first[N], tot;
struct Node {
    ll v, w, nxt;
}e[M];
ll deep[N], f[N], sz[N], son[N];
ll cnt, dfn[N], top[N], w[N];

void init() {
    memset(first,-1,sizeof(first));
    w[1] = 1e18;
    tot = 0;
    cnt = 0;
    deep[0] = 0;
}

void add(ll u, ll v, ll w) {
    e[tot].v = v;
    e[tot].w = w;
    e[tot].nxt = first[u];
    first[u] = tot++;
}

void dfs1(ll u, ll fa) {
    deep[u] = deep[fa]+1;
    f[u] = fa;
    sz[u] = 1;
    son[u] = 0;
    ll maxson = -1;
    for(ll i = first[u]; ~i; i = e[i].nxt) {
        ll v = e[i].v;
        if(v == fa) continue;
        w[v] = w[u]+1;
        dfs1(v,u);
        sz[u] += sz[v];
        if(sz[v] > maxson) son[u] = v, maxson = sz[v];
    }
}

void dfs2(ll u, ll topfa) {
    dfn[u] = ++cnt;
    top[u] = topfa;
    if(!son[u]) return;
    dfs2(son[u],topfa);
    for(ll i = first[u]; ~i; i = e[i].nxt) {
        ll v = e[i].v;
        if(v == son[u] || v == f[u]) continue;
        dfs2(v,v);
    }
}

ll getlca(ll x, ll y) {
    while(top[x] != top[y]) {
        if(deep[top[x]] < deep[top[y]]) swap(x,y);
        x = f[top[x]];
    }
    return deep[x] > deep[y] ? y : x;
}
}

const ll N = 1000005;
bool cmp(ll a, ll b) {
    return shupou::dfn[a] < shupou::dfn[b];
}

ll vis[N], sta[N], top;
vector<ll> e[N];

void push(ll x) {
    int lc = shupou::getlca(x,sta[top]);
    if(lc == sta[top]) {
        sta[++top] = x;
        return;
    }
    while(shupou::deep[lc] <= shupou::deep[sta[top-1]]) e[sta[top-1]].push_back(sta[top]), --top;
    if(shupou::deep[lc] != shupou::deep[sta[top]]) e[lc].push_back(sta[top]), sta[top] = lc;
    sta[++top] = x;
}

ll mp[N], m, ans;
ll dp[N][2]; // 0 子树上没有与u连通的标记最小花费，1有的最小花费

void dfs(ll u) {
    if(mp[u]) dp[u][1] = 0, dp[u][0] = 1e9;
    else dp[u][1] = 0, dp[u][0] = 0; // 当前点有，儿子也有
    ll tmp1 = 1, tmp2 = 0, flag = 1;
    if(mp[u]) flag = 0;
    for(auto v : e[u]) {
        if(mp[v] && mp[u] && shupou::w[v]-shupou::w[u] == 1) ans = 1;
        dfs(v);
        tmp1 += min(dp[v][1], dp[v][0]);// del
        tmp2 += dp[v][0];// nodel
        if(dp[v][1]+1-flag < dp[v][0]) {
            dp[u][1] += dp[v][1]+1-flag;
            flag = 0;
        }
        else dp[u][1] += dp[v][0];
    }
    if(!mp[u]) dp[u][0] = min(tmp1,tmp2);
    e[u].clear();
//    printf("%lld %lld %lld --\n",u,dp[u][0],dp[u][1]);
}

int main() {
    shupou::init();
    ll n;
    scanf("%lld",&n);
    for(ll i = 1; i < n; ++i) {
        ll u, v;
        scanf("%lld%lld",&u,&v);
        shupou::add(u,v,1);
        shupou::add(v,u,1);
    }
    shupou::dfs1(1,0);
    shupou::dfs2(1,1);
    ll t;
    for(scanf("%lld",&t); t; --t) {
        scanf("%lld",&m);
        for(ll i = 1; i <= m; ++i) scanf("%lld",&vis[i]), mp[vis[i]] = 1;
        sort(vis+1,vis+1+m,cmp);
        sta[top = 1] = 1;
        if(vis[1] != 1) push(vis[1]);
        for(ll i = 2; i <= m; ++i) push(vis[i]);
        while(top > 1) e[sta[top - 1]].push_back(sta[top]), --top;
        ans = 0;
        dfs(1);
        printf("%lld\n",ans?-1ll:min(dp[1][0], dp[1][1]));
        for(ll i = 1; i <= m; ++i) mp[vis[i]] = 0;
    }
    return 0;
}