校内赛 Codeforces 815C. Karen and Supermarket 树形DP 解题报告

题目描述

On the way home, Karen decided to stop by the supermarket to buy some groceries.

She needs to buy a lot of goods, but since she is a student her budget is still quite limited. In fact, she can only spend up to b dollars.
The supermarket sells n goods. The i-th good can be bought for ci dollars. Of course, each good can only be bought once.
Lately, the supermarket has been trying to increase its business. Karen, being a loyal customer, was given n coupons. If Karen purchases the i-th good, she can use the i-th coupon to decrease its price by di. Of course, a coupon cannot be used without buying the corresponding good.
There is, however, a constraint with the coupons. For all i ≥ 2, in order to use the i-th coupon, Karen must also use the xi-th coupon (which may mean using even more coupons to satisfy the requirement for that coupon).
Karen wants to know the following. What is the maximum number of goods she can buy, without exceeding her budget b?

Input

The first line of input contains two integers n and b (1 ≤ n ≤ 5000, 1 ≤ b ≤ 109), the number of goods in the store and the amount of money Karen has, respectively.
The next n lines describe the items. Specifically:
The i-th line among these starts with two integers, ci and di (1 ≤ di < ci ≤ 109), the price of the i-th good and the discount when using the coupon for the i-th good, respectively.
If i ≥ 2, this is followed by another integer, xi (1 ≤ xi < i), denoting that the xi-th coupon must also be used before this coupon can be used.

Output

Output a single integer on a line by itself, the number of different goods Karen can buy, without exceeding her budget.

Examples

input
6 16
10 9
10 5 1
12 2 1
20 18 3
10 2 3
2 1 5
output
4
input
5 10
3 1
3 1 1
3 1 2
3 1 3
3 1 4
output
5

Note

In the first test case, Karen can purchase the following 4 items:
Use the first coupon to buy the first item for 10 - 9 = 1 dollar.
Use the third coupon to buy the third item for 12 - 2 = 10 dollars.
Use the fourth coupon to buy the fourth item for 20 - 18 = 2 dollars.
Buy the sixth item for 2 dollars.
The total cost of these goods is 15, which falls within her budget. Note, for example, that she cannot use the coupon on the sixth item, because then she should have also used the fifth coupon to buy the fifth item, which she did not do here.
In the second test case, Karen has enough money to use all the coupons and purchase everything.

思路

很明显是树上DP，可以根据优惠券的约束关系构造成一颗树,考虑树形DP

定义：dp【子树根】【选的物品数】【根用不用优惠券】的最小代价
转移方程：
dp[u][j][1]=min(dp[u][j-k][1],min(dp[v][k][1],dp[v][k][0]))
dp[u][j][0]=min(dp[u][j-k][0],dp[v][k][0]))

显然,直接DP需要O(n3)

考虑优化,维护size[u]=当前u为根的子树已经发现的节点个数
首先对任意u,size[u]=1,求出儿子v后,背包问题搞一下,然后size[u]+=size[v],继续求解其他儿子…
这样复杂度其实只有O(n2),因为子树u内任意2个点对,只同时求了一次
注意如果size[u]+=size[v],再对u,v求背包,复杂度就变为O(n3)了,因为子树v也与自身求了一次背包
看代码吧，有注释也很清真。
难得自己A题

代码

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
const int N=5000+5;
const int inf=0x3f3f3f3f;
//dp[u][j][1]=min(dp[u][j-k][1],min(dp[v][k][1],dp[v][k][0]))
//dp[u][j][0]=min(dp[u][j-k][0],dp[v][k][0]))
struct edge
{
    int u,v,w;
    int next;
}ed[N];
int head[N],num,n,b,ans,c[N],d[N],x[N],w[N],dp[N][N][2],size[N];
//dp【子树根】【选的物品数】【根用不用优惠券】的最小代价 
void build(int u,int v)
{
    ed[++num].v=v;
    ed[num].u=u;
    ed[num].w=1;
    ed[num].next=head[u];
    head[u]=num;
}
void dfs(int u)
{
    size[u]=1;
    dp[u][0][0]=0;//不选不花钱 
    dp[u][1][0]=c[u];//不用就自己 
    dp[u][1][1]=c[u]-d[u];//用了就减去 
    for (int i=head[u];i!=-1;i=ed[i].next)
    {
        int v=ed[i].v;
        dfs(v);
        for (int j=size[u];j>=0;j--)//除开v 
        for (int k=0;k<=size[v];k++)//v子树 
        {
            dp[u][j+k][0]=min(dp[u][j+k][0],dp[u][j][0]+dp[v][k][0]);
            dp[u][j+k][1]=min(dp[u][j+k][1],dp[u][j][1]+dp[v][k][1]);
            dp[u][j+k][1]=min(dp[u][j+k][1],dp[u][j][1]+dp[v][k][0]);
        }
        size[u]+=size[v];
    }//LCA?
}
void init()
{
    memset(head,-1,sizeof(head));
    memset(dp,inf,sizeof(dp));
    num=0;ans=0;
}
int main()
{
    freopen("shopping.in","r",stdin);
    freopen("shopping.out","w",stdout);
    init();
    scanf("%d%d",&n,&b);
    for (int i=1;i<=n;i++)
    {
        int x;
        scanf("%d%d",&c[i],&d[i]);
        if (i>=2) 
        {
            scanf("%d",&x);
            build(x,i); 
        }
    }
    dfs(1);
    for (int i=n;i>=0;i--)
    if (dp[1][i][0]<=b||dp[1][i][1]<=b) {ans=i;break;}//满足的最大 
    printf("%d\n",ans);
    return 0;
}