oj.uz

답안 #673351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673351 2022-12-20T09:12:16 Z viwlesxq 바이오칩 (IZhO12_biochips) C++17
90 / 100
 302 ms 402556 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 + 5, M = 5e2 + 5, inf = 1e9 + 7;
vector <int> g[N];
int dp[N][M], p[N], x[N], timer = 1, tin[N], arr[N];

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);
	int n, m;
	cin >> n >> m;
	int root = -1;
	for (int i = 1; i <= n; i++) {
		cin >> p[i] >> x[i];
		if (!p[i]) root = i;
		else g[p[i]].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
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5072 KB Output is correct
2 Incorrect 3 ms 4948 KB Output isn't correct
3 Correct 3 ms 5204 KB Output is correct
4 Correct 13 ms 22868 KB Output is correct
5 Correct 18 ms 25172 KB Output is correct
6 Correct 15 ms 25044 KB Output is correct
7 Correct 190 ms 299944 KB Output is correct
8 Correct 192 ms 299936 KB Output is correct
9 Correct 251 ms 364652 KB Output is correct
10 Correct 302 ms 402556 KB Output is correct