# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89839 | Vardanyan | Biochips (IZhO12_biochips) | C++17 | 2057 ms | 404216 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.
#pragma GCC optimize "-O3"
#include<bits/stdc++.h>
using namespace std;
const int N = 200*1000+5;
const int M = 505;
int dp[N][M];
int tin[N];
int tout[N];
int a[N];
int d[N];
vector<int> g[N];
int timer = 0;
void dfs(int v){
tin[v] = ++timer;
d[timer] = a[v];
dp[timer][1] = a[v];
for(int i = 0;i<g[v].size();i++){
int to = g[v][i];
dfs(to);
}
tout[tin[v]] = timer;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int root;
for(int i = 1;i<=n;i++){
int x,y;
scanf("%d%d",&x,&y);
if(x == 0) root = i;
if(x){
g[x].push_back(i);
}
a[i] = y;
}
dfs(root);
for(int j = 1;j<=m;j++){
for(int i = timer;i>=1;i--){
//cout<<d[i]<<endl;
dp[i][j] = max(dp[i][j],dp[i+1][j]);
if(tout[i]+1<=timer) dp[i][j] = max(dp[i][j],dp[tout[i]+1][j-1]+d[i]);
}
}
cout<<dp[1][m]<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |