# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359955 | Fischer | Biochips (IZhO12_biochips) | C++14 | 672 ms | 406508 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 = 2e5 + 10;
int dp[maxn][510];
vector<int> g[maxn];
int c[maxn];
int sz[maxn];
int n, m;
void dfs(int x) {
sz[x] = 0;
for (int i = 1; i <= m; ++i) dp[x][i] = -1e9;
for (int v : g[x]) {
dfs(v);
for (int i = min(m, sz[x]+sz[v]); i >= 1; --i) {
for (int j = max(1, i-sz[x]); j <= min(i, sz[v]); ++j) {
dp[x][i] = max(dp[x][i], dp[x][i-j] + dp[v][j]);
}
}
sz[x] += sz[v];
}
sz[x] += 1;
dp[x][1] = max(dp[x][1], c[x]);
}
int main() {
cin >> n >> m;
int root = 0;
for (int i = 1; i <= n; ++i) {
int pi;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |