M题:
链接:
https://ac.nowcoder.com/acm/contest/10272/M
题意:给你一棵树,消除一个点的代价为该点的值加上其儿子节点的值,但我们存在魔法,每次魔法可以用0法力消除一个点,求我们有0~n次魔法时消除所有点所需的最小法力值
思路:三维dp,dp[i][j][k],在以i为根的子树里面消除j个点所需的最小法力,k为1时选有i这个点,后续遍历并且每次枚举i与其每个儿子节点,求其最小值
代码如下:
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 200015;
#define inf 4e18
#define YES cout<<"Yes"<<'\n';
#define NO cout<<"No"<<'\n';
#define pi pair<ll,ll>
void solve()
{
ll n;cin>>n;
vector<vector<ll>>a(n+1);
vector<ll>w(n+1),sz(n+1);
for(ll i=2;i<=n;i++)
{
ll x;cin>>x;
a[x].push_back(i);
a[i].push_back(x);
}
for(ll i=1;i<=n;i++){
cin>>w[i];
}
vector<vector<vector<ll>>>dp(n+1,vector<vector<ll>>(n+1,vector<ll>(2)));
auto dfs1=[&](auto &selfz,ll x,ll fa)->void
{
sz[x]=1;
dp[x][0][0]=w[x];
dp[x][0][1]=inf;
dp[x][1][0]=inf;
dp[x][1][1]=0;
for(auto c:a[x])
{
if(c==fa) continue;
selfz(selfz,c,x);
vector<ll>dp0(sz[x]+sz[c]+1,inf),dp1(sz[x]+sz[c]+1,inf);
for(ll i=0;i<=sz[x];i++)
{
for(ll j=0;j<=sz[c];j++)
{
dp0[i+j] = min(dp0[i+j],dp[x][i][0]+dp[c][j][0]+w[c]);
dp0[i+j] = min(dp0[i+j],dp[x][i][0]+dp[c][j][1]);
dp1[i+j] = min(dp1[i+j],dp[x][i][1]+min(dp[c][j][0],dp[c][j][1]));
}
}
sz[x]+=sz[c];
for(int i=0;i<=sz[x];i++){
dp[x][i][0] = dp0[i];
dp[x][i][1] = dp1[i];
}
}
};
dfs1(dfs1,1,0);
for(ll i=0;i<=n;i++)
{
cout<<min(dp[1][i][0],dp[1][i][1])<<' ';
}
cout<<'\n';
}
int main()
{
ll t=1;
cin>>t;
while(t--) solve();
return 0;
}