oj.uz

Submission #913972

# Submission time Handle Problem Language Result Execution time Memory
913972 2024-01-20T16:30:50 Z trashaccount Biochips (IZhO12_biochips) C++17
90 / 100
 198 ms 405528 KB 
#include <bits/stdc++.h>
using namespace std;

int N, M, p[200005], x[200005], rt;
vector <int> son[200005];
int timer = 0, tin[200005], tout[200005], tour[200005], dp[200005][505];

void dfs(int u){
	tin[u] = ++timer;
	tour[timer] = u;
	for (int v : son[u]){
		dfs(v);
	}
	tout[u] = timer;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> N >> M;
	for (int i = 1; i <= N; i++){
		cin >> p[i] >> x[i];
		if (!p[i]) rt = i;
		son[p[i]].push_back(i);
	}
	dfs(rt);
	for (int i = 1; i <= M; i++) dp[N+1][i] = -1e9;
	for (int i = N; i >= 1; i--){
		int u = tour[i];
		for (int j = 1; j <= M; j++)
			dp[i][j] = max(dp[tout[u]+1][j-1]+x[u], dp[i+1][j]);
	}
	cout << dp[1][M];
	return 0;
}

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 8 ms 27484 KB Output is correct
5 Correct 10 ms 29532 KB Output is correct
6 Correct 8 ms 29560 KB Output is correct
7 Correct 118 ms 302244 KB Output is correct
8 Correct 127 ms 302424 KB Output is correct
9 Correct 149 ms 368216 KB Output is correct
10 Correct 198 ms 405528 KB Output is correct