# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31935 | kazel | Biochips (IZhO12_biochips) | C++14 | 149 ms | 21576 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;
int val[200001], m;
vector<int> g[200001], dp[200001];
void dfs(int c)
{
if(g[c].empty())
{
dp[c].push_back(val[c]);
return;
}
priority_queue<tuple<int,int,int>> pq;
for(int e : g[c])
{
dfs(e);
pq.emplace(dp[e][0],e,1);
}
int v = 0;
for(int t=0;t<m;t++)
{
if(pq.empty()) break;
int x,y,z;
tie(x,y,z) = pq.top();
pq.pop();
v += x;
dp[c].push_back(v);
if(dp[y].size()<=z) continue;
x = dp[y][z]-dp[y][z-1];
pq.emplace(x,y,z+1);
}
if(dp[c][0] < val[c]) dp[c][0] = val[c];
for(int e : g[c]) dp[e].clear();
}
int main()
{
int n, r;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
int p;
scanf("%d%d",&p,val+i);
if(!p) r = i;
else g[p].push_back(i);
}
dfs(r);
printf("%d\n",dp[r][m-1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |