2020 ICPC 南京站补题
M题
这题是一道比较简单的dp,当时老是想着怎么先把树按字典序排一下序,卡了一会儿
其实没有必要,直接递归+背包就能解决,加上一个额外的状态维度之后,状态转移也比较好想。
比较大的问题是for循环的顺序,这里对i和k都需要从大到小循环。(因为我dp数组的定义顺序是反过来的,dp[0/1][i][j]表示i子树下有j个结点存活时的最优答案。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2001;
int n, hp[maxn];
ll dp[2][maxn][maxn];
// dp[0/1][i][k]:
// i th subtree, k nodes enabled
const ll inf = 1LL * 1e18;
struct node
{
int v, f, n;
vector<int> s;
};
node a[maxn];
void search(int idx)
{
dp[0][idx][0] = 0;
dp[1][idx][1] = a[idx].v;
for (auto son : a[idx].s)
{
search(son);
for (int i = a[idx].n; i >= 0; i--)
{
for (int k = a[son].n; k >= 0; k--)
{
dp[0][idx][i + k] = min(dp[0][idx][i + k], dp[0][idx][i] + min(dp[1][son][k], dp[0][son][k]));
dp[1][idx][i + k] = min(dp[1][idx][i + k], dp[1][idx][i] + min(dp[0][son][k], dp[1][son][k] + a[son].v));
}
}
a[idx].n += a[son].n;
}
}
int main()
{
// freopen("min", "r", stdin);
int tests;
scanf("%d", &tests);
while (tests--)
{
scanf("%d", &n);
for (int i = 0; i <= n; ++i)
{
a[i].s.clear();
a[i].n = 1;
}
a[1].f = -1;
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= n; ++j)
{
dp[0][i][j] = inf;
dp[1][i][j] = inf;
}
// above for reset
for (int i = 2, tmp; i <= n; ++i)
{
scanf("%d", &tmp);
a[tmp].s.push_back(i);
a[i].f = tmp;
}
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i].v);
// above for init
search(1);
// for (int i = 1; i <= n; ++i)
// {
// cout << i << ": ";
// for (auto j : a[i].s)
// cout << j << " ";
// cout << "| num=" << a[i].n << " v=" << a[i].v;
// cout << endl;
// }
for (int i = 0; i < n; ++i)
printf("%lld ", min(dp[1][1][n - i], dp[0][1][n - i]));
puts("0");
}
return 0;
}