codeforces round #419 E. Karen and Supermarket

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.

题解：

树上背包哈，F[x][j][0/1]表示x子节点和本身中，选j个，当前节点是否打折(0/1)

方程式：

F[x][j+k][0]=min(F[x][j+k][0],F[u][k][0]+F[x][j][0])
F[x][j+k][1]=min(F[x][j+k][1],F[u][k][1]+F[x][j][1])
F[x][j+k][1]=min(F[x][j+k][1],F[u][k][0]+F[x][j][1])

复杂度O（n^2）.

注意初始化和边界调节:

F[x][0][0]是要赋为0的，因为当前节点不打折时是可以不选的,而F[x][0][1]不能.

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 using namespace std;
 typedef long long ll;
 const int N=;
 int n,m;
 int head[N],num=,w[N],h[N],now[N];ll F[N][N][];
 struct Lin
 {
     int next,to;
 } a[N<<];
 void init(int x,int y)
 {
     a[++num].next=head[x];
     a[num].to=y;
     head[x]=num;
 }
 void dfs(int x)
 {
     int u;
     now[x]=;
     F[x][][]=;
     F[x][][]=w[x];F[x][][]=h[x];
     for(int i=head[x]; i; i=a[i].next)
         {
             u=a[i].to;
             dfs(u);
             for(int j=now[x];j>=;j--)
                 {
                     for(int k=; k<=now[u]; k++)
                         {
                             F[x][j+k][]=min(F[x][j+k][],F[u][k][]+F[x][j][]);
                             F[x][j+k][]=min(F[x][j+k][],F[u][k][]+F[x][j][]);
                             F[x][j+k][]=min(F[x][j+k][],F[u][k][]+F[x][j][]);
                         }
                 }
             now[x]+=now[u];//now为当前节点的子节点个数.
         }
 }
 int main()
 {
     scanf("%d%d",&n,&m);
     int x,y,fa;
     scanf("%d%d",&w[],&h[]);
     h[]=w[]-h[];
     memset(F,/,sizeof(F));
     for(int i=; i<=n; i++)
         {
             scanf("%d%d%d",&x,&y,&fa);
             w[i]=x;
             h[i]=x-y;
             init(fa,i);
         }
     dfs();
     for(int i=n; i>=; i--)
         if(F[][i][]<=m || F[][i][]<=m)
             {
                 printf("%d",i);
                 break;
             }
     return ;
 }