oj.uz

답안 #913951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
913951 2024-01-20T16:08:02 Z daoquanglinh2007 바이오칩 (IZhO12_biochips) C++17
0 / 100
 527 ms 405228 KB 
#include <bits/stdc++.h>
using namespace std;

const int NM = 2e5, MM = 500, inf = 1e9;

int N, M, root, p[NM+5], x[NM+5], timer = 0, tin[NM+5], tout[NM+5], tour[NM+5];
vector <int> son[NM+5];
int dp[NM+5][MM+5];

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

int main(){
	//freopen("BIOCHIPS.inp", "r", stdin);
	//freopen("BIOCHIPS.out", "w", stdout);
	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] == 0) root = i;
		son[p[i]].push_back(i);
	}
	dfs_euler_tour(root);
	for (int i = 1; i <= M; i++) dp[N+1][i] = -inf;
	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]][j-1]+x[u], dp[i+1][j]);
	}
	cout << dp[1][M];
	return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8536 KB Output isn't correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Incorrect 2 ms 10840 KB Output isn't correct
4 Incorrect 13 ms 27484 KB Output isn't correct
5 Incorrect 13 ms 29528 KB Output isn't correct
6 Incorrect 13 ms 29528 KB Output isn't correct
7 Incorrect 324 ms 302416 KB Output isn't correct
8 Incorrect 319 ms 302344 KB Output isn't correct
9 Incorrect 424 ms 368536 KB Output isn't correct
10 Incorrect 527 ms 405228 KB Output isn't correct