oj.uz

Submission #435950

# Submission time Handle Problem Language Result Execution time Memory
435950 2021-06-24T02:30:50 Z cgiosy Biochips (IZhO12_biochips) C++17
100 / 100
 205 ms 10056 KB 
// gs14004's code test
#include <bits/stdc++.h>
using namespace std;

int n,m,inp[200005];
 
int piv,sz[200005],a[200005];
vector<int> g[200005];
int root;
 
int dfs(int x){
    int num = ++piv;
    a[num] = inp[x];
    sz[num] = 1;
    for(int &i : g[x]){
        sz[num] += dfs(i);
    }
    return sz[num];
}
 
int dp[2][200005];
 
void mx(int&a, int b) { a=max(a, b); }
int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int N, K, r;
	cin>>N>>K;n=N,m=K;
	for(int i=1; i<=N; i++) {
		int p;
		cin>>p>>inp[i];
		if(p) g[p].push_back(i);
		else root=r=i;
	}
    dfs(root);
    for (int i=1; i<=m; i++) {
        dp[i%2][n+1] = -1e9;
        for (int j=n; j; j--) {
            dp[i%2][j] = max(dp[i%2][j+1],dp[(i-1)%2][j+sz[j]] + a[j]);
        }
    }
	cout<<dp[m%2][1]<<'\n';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 8 ms 5324 KB Output is correct
5 Correct 8 ms 5324 KB Output is correct
6 Correct 11 ms 5332 KB Output is correct
7 Correct 119 ms 8936 KB Output is correct
8 Correct 131 ms 9092 KB Output is correct
9 Correct 156 ms 9628 KB Output is correct
10 Correct 205 ms 10056 KB Output is correct