Submission #359930

#	Time	Username	Problem	Language	Result	Execution time	Memory
359930		Fischer	Biochips (IZhO12_biochips)	C++14	0 / 100	4 ms	5100 KiB

biochips

#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] = 1;
	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(m, sz[v]); ++j) {
				dp[x][i] = max(dp[x][i], dp[x][i - j] + dp[v][j]);
			}
		}
		sz[x] += sz[v];
	}
	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;
		cin >> pi >> c[i];
		if (pi == 0) root = i;
		else g[pi].push_back(i);
	}
	dfs(root);
	cout << dp[root][m] << endl;
	return 0;
}

• Subtask 1: 0 / 100