|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|2 초 (추가 시간 없음)||512 MB||1||1||1||100.000%|
Do you know where is the baobab in the Math&Mech facility? Well, if no, ask someone after the contest to show you...
Everyone knows that baobab is a tree. So, as any tree, it has trunk and branches. Branches grow from the trunk or from other branches.
For September 1, this baobab is usually decorated to make new students feel comfortable. For this purpose, there is a large chest with small colorful decorations deep in the building dungeons. Every decoration weighs exactly one gram.
Unfortunately, the baobab is very old, therefore it will be broken if overloaded with decorations. Specifically, for every branch, you know the maximum weight of decorations it can carry. If a branch, together with all branches growing from it (directly or via other branches), carries decorations such that their total weight exceeds this limit, this branch will break. This is unacceptable. But you can put several decorations on a single branch unless it causes some branch to break.
Some branches are near the entry and well shown, others are hidden in the depths of the baobab. Therefore, every decoration can bring more or less joy, depending on its position. The total joy of the baobab is the sum of joys of the branches where the decorations are located. If there are several decorations on a single branch, its joy is multiplied by their quantity.
What is the maximum possible total joy the baobab can have?
The first line contains two integers $n$ and $t$: the number of branches on the baobab and the number of decorations ($1 \le n \le 100\,000$, $1 \le t \le 10^9$). Each of the next $n$ lines contains three integers, $d_i$, $p_i$, and $w_i$: the joy delivered by a single decoration on $i$-th branch, the branch that $i$-th branch grows from (or $0$ if this branch grows directly from the trunk), and the maximum weight of decorations $i$-th branch can carry ($1 \le d_i, w_i \le 10^9$, $0 \le p_i \le n$).
It is guaranteed that every branch grows from the trunk, directly or via other branches. Also it is guaranteed that it is possible to use all decorations.
Output one integer: the maximum possible total joy delivered by the decorated baobab.
9 6 30 0 4 40 9 2 80 8 3 20 9 2 10 4 3 70 5 8 90 2 4 50 0 6 60 1 3