# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896674 | borisAngelov | Biochips (IZhO12_biochips) | C++17 | 309 ms | 13352 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;
const int maxn = 200005;
const int maxm = 505;
const int inf = 1e9;
int n, m;
int a[maxn];
int root = -1;
vector<int> tree[maxn];
vector<int> combine(vector<int>& a, vector<int>& b)
{
vector<int> c(min(m + 1, int(a.size() + b.size())), -inf);
for (int i = 0; i < a.size(); ++i)
{
for (int j = 0; j < b.size() && i + j <= m; ++j)
{
c[i + j] = max(c[i + j], a[i] + b[j]);
}
}
return c;
}
vector<int> dfs(int node, int par)
{
vector<int> dp(2, 0);
for (int i = 0; i < tree[node].size(); ++i)
{
if (tree[node][i] != par)
{
vector<int> child = dfs(tree[node][i], node);
dp = combine(dp, child);
}
}
dp[1] = max(dp[1], a[node]);
return dp;
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> m;
for (int i = 1; i <= n; ++i)
{
int par;
cin >> par >> a[i];
if (par == 0)
{
root = i;
}
else
{
tree[par].push_back(i);
tree[i].push_back(par);
}
}
vector<int> dp = dfs(root, -1);
cout << dp[m] << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |