# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302550 | milisav | Biochips (IZhO12_biochips) | C++14 | 4 ms | 4992 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>
#pragma GCC optimize("O3")
#define maxn 200010
#define maxm 510
using namespace std;
int n,m;
int rt;
int p[maxn];
int x[maxn];
vector<int> ch[maxn];
int a[maxn];
int s[maxn];
int dp[maxn][maxm];
int id=0;
void dfs(int u) {
int cid=id++;
a[cid]=x[u];
for(auto v:ch[u]) dfs(v);
s[cid]=id;
}
int main() {
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++) {
scanf("%d %d",&p[i],&x[i]);
if(p[i]==0) rt=i;
else ch[p[i]].push_back(i);
}
dfs(rt);
for(int j=1;j<=m;j++) dp[0][j]=-1e9;
for(int i=0;i<n;i++) {
if(s[i]!=i+1) for(int j=0;j<=m;j++) dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
for(int j=0;j<=m-1;j++) dp[s[i]][j+1]=max(dp[s[i]][j+1],dp[i][j]+a[i]);
}
printf("%d",dp[n][m]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |