The more, The Better
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6576 Accepted Submission(s): 3863
#include<cstring>
#include<cstdio>
int dp[250][250]={0};
int map[250][250]={0};
int num[250]={0};
int v[250]={0};
bool vis[250]={0};
void dfs(int p);
int max(int x,int y);
int n=0,m=0;
int main()
{
while(scanf("%d%d",&n,&m),n||m)
{
memset(map,0,sizeof(map));
memset(dp,0,sizeof(dp));
memset(num,0,sizeof(num));
memset(v,0,sizeof(v));
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
int a=0,b=0;
scanf("%d%d",&a,&v[i]);
dp[i][1]=v[i];
map[a][++num[a]]=i;
}
m++;
dp[0][1]=0;
for(int i=1;i<=n;i++)
{
dp[i][0]=0;
vis[i]=0;
for(int j=2;j<=m;j++)
{
dp[i][j]=-1;
}
}
dfs(0);
printf("%d\n",dp[0][m]);
}
return 0;
}
void dfs(int p)
{
for(int i=1;i<=num[p];i++)
{
int t=map[p][i];
if(!vis[t]) dfs(t);
for(int j=m;j>=2;j--)
{
for(int k=1;k<j;k++)
{
if(dp[t][j-k]!=-1&&dp[p][k]!=-1)
dp[p][j]=max(dp[p][j],dp[p][k]+dp[t][j-k]);
}
}
}
}
int max(int x,int y)
{
if(x>y) return x;
return y;
}