# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85248 | zoooma13 | Biochips (IZhO12_biochips) | C++14 | 2094 ms | 183576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 200005
#define MAX_M 502
#define INF 0x3f3f3f3f
int N ,M;
int A ,B;
int Mem[MAX_N];
vector <int> Adj[MAX_N];
int dp[MAX_M][MAX_N];
void Solve(int v)
{
int dp_new[M+1] ,dp_all[M+1] = {0};
for(int i : Adj[v])
{
Solve(i);
memset(dp_new ,-INF ,sizeof dp_new);
for(int j=1; j<=M; j++)
for(int k=0; k<=M-j; k++)
dp_new[j+k] = max(dp_new[j+k] ,dp_all[k] + dp[j][i]);
for(int k=0; k<=M; k++)
dp_all[k] = max(dp_all[k] ,dp_new[k]);
}
for(int l=0; l<=M; l++)
dp[l][v] = dp_all[l];
dp[1][v] = max(dp[1][v] ,Mem[v]);
}
int main()
{
scanf("%d%d",&N,&M); assert(N < MAX_N && M < MAX_M);
int root;
for(int i=1; i<=N; i++)
{
scanf("%d%d",&A,&B);
Mem[i] = B;
if(A == 0)
root = i;
else
Adj[A].push_back(i);
}
Solve(root);
printf("%d\n",dp[M][root]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |