# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334673 | iulia13 | Biochips (IZhO12_biochips) | C++14 | 1321 ms | 524292 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 <iostream>
#include <deque>
#include <vector>
using namespace std;
int dp[505][400005];
vector <int> g[200005];
int v[200005];
int in[200005];
int out[200005];
int ord[400005];
int timp = 0;
void dfs(int nod)
{
timp++;
ord[timp] = nod;
for (int i = 0; i < g[nod].size(); i++)
{
int x = g[nod][i];
dfs(x);
}
out[nod] = ++timp;
}
int main()
{
int n, m, i, j, r, k, l, x;
cin >> n >> m;
for (i = 1; i <= n; i++)
{
cin >> x >> v[i];
if (x)
g[x].push_back(i);
else
r = i;
}
dfs(r);
for (j = 0; j <= m; j++)
for (i = 1; i <= timp; i++)
dp[j][i] = -2e9;
dp[0][1] = 0;
for (j = 0; j <= m; j++)
for (i = 1; i <= timp; i++)
{
int last = out[ord[i]];
dp[j][i + 1] = max(dp[j][i + 1], dp[j][i]);
if (j < m)
dp[j + 1][last] = max(dp[j + 1][last], dp[j][i] + v[ord[i]]);
}
cout << dp[m][timp];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |