DP(树型专题六)

题意:

• 给定一棵树
• 我们可以标记一个节点, 那么与这个结点直接相连的结点也相当于被标记了

问, 我要使得这棵树上所有的结点都被标记最少得标记多少结点

>>P2899 [USACO08JAN]手机网络Cell Phone Network <<

strategy : 每个被标记的结点都有三种状态

• 1:爸爸罩着自己的
• 2:自己罩着自己的
• 3:儿子罩着自己的

状态: $dp[i][j]:$ 使得$i$号结点状态为$j$的最小花费

目标: $min(dp[1][0],dp[1][2])$根节点自己罩着自己或者根节点儿子罩着自己

边界: 所有自己罩着自己的情况设为1,儿子罩着自己的设为无穷大

转移: trans

双倍经验: 状态分析

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define bin(x) cerr << #x << " is " << bitset<15>(x) << endl
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int maxn = 2e4 + 10;
struct node
{
    int nxt, to;
} way[maxn];
ll cnt, head[maxn], dp[maxn][3], n;
void addedge(int from, int to)
{
    way[++cnt].to = to;
    way[cnt].nxt = head[from];
    head[from] = cnt;
}
/*
dp[cur][0]fa
dp[cur][1]self
dp[cur][2]son
*/
void dfs(int cur, int fa)
{
    dp[cur][1] = 1, dp[cur][2] = oo;
    for (int i = head[cur]; i; i = way[i].nxt)
    {
        int to = way[i].to;
        if (to == fa)
            continue;
        dfs(to, cur);
        dp[cur][1] += min(dp[to][0], min(dp[to][1], dp[to][2]));
        dp[cur][0] += min(dp[to][1], dp[to][2]);
    }
    for(int i = head[cur];i;i = way[i].nxt){
        int to = way[i].to;
        if(to == fa)continue;
        dp[cur][2] = min(dp[cur][2], dp[cur][0] - min(dp[to][1], dp[to][2]) + dp[to][1]);
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n;
    _rep(i, 1, n - 1)
    {
        int f, t;
        cin >> f >> t;
        addedge(f, t), addedge(t, f);
    }
    dfs(1, 0);
    cout << min(dp[1][1], dp[1][2]) << endl;
}

第一次回顾

#include <bits/stdc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define bin(x) cerr << #x << " is " << bitset<15>(x) << endl
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int maxn = 1e4 + 10;
int head[maxn], cnt, n, dp[maxn][3];
struct node
{
    int nxt, to;
} way[maxn * 2];
void addedge(int from, int to)
{
    way[++cnt].to = to;
    way[cnt].nxt = head[from];
    head[from] = cnt;
}
void dfs(int cur, int fa)
{
    dp[cur][0] = 1;
    dp[cur][1] = oo;
    for(int i = head[cur];i;i = way[i].nxt){
        int to = way[i].to;
        if(to == fa)continue;
        dfs(to, cur);
        dp[cur][0] += dp[to][2];
        dp[cur][2] += dp[to][1];
    }
    if(head[cur] == 0){
        dp[cur][1] = 1;
    }else {
        for(int i = head[cur];i;i = way[i].nxt){
            int to = way[i].to;
            if(to == fa)continue;
            dp[cur][1] = min(dp[cur][1], dp[to][0] + dp[cur][2] - dp[to][1]);
        }
    }
    _rep(i, 1, 2){
        dp[cur][i] = min(dp[cur][i], dp[cur][i-1]);
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n;
    _rep(i, 1, n - 1)
    {
        int u, v;
        cin >> u >> v;
        addedge(u, v), addedge(v, u);
    }
    dfs(1, 0);
    cout << dp[1][1] << endl;
}