bzoj1722[Usaco2006 Mar] Milk Team Select 产奶比赛

http://www.elijahqi.win/archives/1438
Description

Farmer John’s N (1 <= N <= 500) cows are trying to select the milking team for the world-famous Multistate Milking Match-up (MMM) competition. As you probably know, any team that produces at least X (1 <= X <= 1,000,000) gallons of milk is a winner. Each cow has the potential of contributing between -10,000 and 10,000 gallons of milk. (Sadly, some cows have a tendency to knock over jugs containing milk produced by other cows.) The MMM prides itself on promoting family values. FJ’s cows have no doubt that they can produce X gallons of milk and win the contest, but to support the contest’s spirit, they want to send a team with as many parent-child relationships as possible (while still producing at least X gallons of milk). Not surprisingly, all the cows on FJ’s farm are female. Given the family tree of FJ’s cows and the amount of milk that each would contribute, compute the maximum number of parent-child relationships that can exist in a winning team. Note that a set of cows with a grandmother-mother-daughter combination has two parent-child relationships (grandmother-mother, mother-daughter).

约翰的N(1≤N≤500)头奶牛打算组队去参加一个世界级的产奶比赛(Multistate Milking

Match-up，缩写为MMM)．她们很清楚其他队的实力，也就是说，她们派出的队只要能产出至少X(I≤X≤1000000)加仑牛奶，就能赢得这场比赛． 每头牛都能为集体贡献一定量的牛奶，数值在-10000到10000之间（有些奶牛总是想弄翻装着其他奶牛产的奶的瓶子）．

MMM的举办目的之一，是通过竞赛中的合作来增进家庭成员之间的默契．奶牛们认为她们总是能赢得这场比赛，但为了表示对比赛精神的支持，她们希望在选出的队伍里能有尽可能多的牛来自同一个家庭，也就是说，有尽可能多对的牛有直系血缘关系（当然，这支队伍必须能产出至少X加仑牛奶）．当然了，所有的奶牛都是女性，所以队伍里所有直系血亲都是母女关系．    约翰熟知所有奶牛之间的血缘关系．现在他想知道，如果在保证一支队伍能赢得比赛的情况下，队伍中最多能存在多少对血缘关系．注意，如果一支队伍由某头奶牛和她的母亲、她的外祖母组成，那这支队伍里一共有2对血缘关系（这头奶牛外祖母与她的母亲，以及她与她的母亲）．

Input

• Line 1: Two space-separated integers, N and X. * Lines 2..N+1: Line i+1 contains two space-separated integers describing cow i. The first integer is the number of gallons of milk cow i would contribute. The second integer (range 1..N) is the index of the cow’s mother. If the cow’s mother is unknown, the second number is 0. The family information has no cycles: no cow is her own mother, grandmother, etc.

  第1行：两个用空格隔开的整数N和X.

  第2到N+1行：每行包括两个用空格隔开的整数，第一个数为一只奶牛能贡献出的牛奶的加仑数，第二个数表示她的母亲的编号．如果她的母亲不在整个牛群里，那第二个数为0．并且，血缘信息不会出现循环，也就是说一头奶牛不会是自己的母亲或祖母，或者更高代的祖先．

Output

• Line 1: The maximum number of parent-child relationships possible on a winning team. Print -1 if no team can win.

  输出在一个能获胜的队伍中，最多可能存在的有血缘关系的牛的对数．如果任何一支队伍都不可能获胜，输出-1.

Sample Input

5 8 -1 0 //第一个数字代表这头奶的产量,第二个数字代表其父亲点是哪一个. 3 1 5 1 -3 3 2 0 INPUT DETAILS: There are 5 cows. Cow 1 can produce -1 gallons and has two daughters, cow 2 and 3, who can produce 3 and 5 gallons, respectively. Cow 3 has a daughter (cow 4) who can produce -3 gallons. Then there’s cow 5, who can produce 2 gallons.

Sample Output

2

HINT

约翰一共有5头奶牛．第1头奶牛能提供-1加仑的牛奶，且她是第2、第3头奶牛的母亲．第2、第3头奶牛的产奶量务别为3加仑和5加仑．第4头奶牛是第3头奶牛的女儿，她能提供-3加仑牛奶．还有与其他牛都没有关系的第5头奶牛，她的产奶量是2加仑．

最好的一支队伍包括第1，2，3，5头奶牛．她们一共能产出（-1）+3+5+2=9≥8加仑牛奶，

并且这支队伍里有2对牛有血缘关系（1—2和1-3）．如果只选第2，3，5头奶牛，虽然总产奶量会更高（10加仑），但这支队伍里包含的血缘关系的对数比上一种组合少（队伍里没有血缘关系对）．

Source

Gold

设dp[i][j][op]表示i号节点有j对关系 根节点选或者不选

那么转移方程就有dp[x][j][0]=dp[y][z][1/0]+dp[x][j-z][0]

dp[x][j][1]=dp[y][z][0]+dp[x][j-z][1]

dp[x][j][1]=dp[y][z][1]+dp[x][j-z-1][1]

#include <cstdio>
#include <cstring>
#include <algorithm>
#define inf 0x3f3f3f3f
using namespace std;
#define N 550
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=gc();}
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
    return x*f;
}
struct node{
    int y,next;
}data[N];
int n,x,a[N],num,h[N],size[N],dp[N][N][2];//dp[i][j][op]琛ㄧずi鍙疯妭鐐归€塲瀵瑰叧绯绘牴鑺傜偣涓嶉€夋垨閫夌殑鏈€澶氫骇濂堕噺
void dfs(int x){
    size[x]=1;
    for (int i=h[x];i;i=data[i].next){
        int y=data[i].y;dfs(y);size[x]+=size[y];
        for (int j=size[x]-1;j>=0;--j){
            for (int z=0;z<=size[y]-1&&z<=j;++z) dp[x][j][0]=max(dp[x][j][0],dp[x][j-z][0]+max(dp[y][z][0],dp[y][z][1]));
            if (x==0) continue;
            for (int z=0;z<=size[y]-1&&z<=j;++z) dp[x][j][1]=max(dp[x][j][1],dp[x][j-z][1]+dp[y][z][0]);
            for (int z=0;z<=size[y]-1&&z<j;++z) dp[x][j][1]=max(dp[x][j][1],dp[x][j-z-1][1]+dp[y][z][1]);
        }
    }for (int j=0;j<=size[x]-1;++j) dp[x][j][1]+=a[x];
}
int main(){
    //freopen("bzoj1722.in","r",stdin);
    n=read();x=read();
    for (int i=0;i<=n;++i) for (int j=0;j<=n;++j) for (int z=0;z<=1;++z) dp[i][j][z]=-inf;
    for (int i=0;i<=n;++i)
        for (int j=0;j<=1;++j) dp[i][0][j]=0;
    for (int i=1;i<=n;++i){
        a[i]=read();int fa=read();
        data[++num].y=i;data[num].next=h[fa];h[fa]=num;
    }int ans=-1;dfs(0);
    for (int i=size[0]-1;i>=0;--i)if (dp[0][i][0]>=x) {ans=i;break;}
    printf("%d",ans);
    return 0;
}