oj.uz

Submission #673374

# Submission time Handle Problem Language Result Execution time Memory
673374 2022-12-20T12:01:28 Z viwlesxq Biochips (IZhO12_biochips) C++17
100 / 100
 292 ms 398660 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = int64_t;
using str = string;
 
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
 
const int N = 2e5 + 1, M = 5e2 + 1, inf = 1e9 + 7;
vector <int> g[N];
int dp[N][M], x[N], timer, tin[N], arr[N], n, m, p;
 
void dfs(int v) {
	int in = timer;
	for (int to : g[v]) dfs(to);
	tin[timer] = in;
	arr[timer] = x[v];
	timer++;
}
 
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	int root = -1;
	timer = 1;
	for (int i = 1; i <= n; i++) {
		cin >> p >> x[i];
		if (!p) root = i;
		g[p].pb(i);
	}
	dfs(root);
	for (int i = 0; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			dp[i][j] = -inf;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			dp[i][j] = max(dp[i - 1][j], dp[tin[i] - 1][j - 1] + arr[i]);
		}
	}
	cout << dp[n][m];
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 13 ms 22588 KB Output is correct
5 Correct 15 ms 24856 KB Output is correct
6 Correct 15 ms 24788 KB Output is correct
7 Correct 213 ms 297092 KB Output is correct
8 Correct 214 ms 297044 KB Output is correct
9 Correct 248 ms 361164 KB Output is correct
10 Correct 292 ms 398660 KB Output is correct