oj.uz

Submission #435954

# Submission time Handle Problem Language Result Execution time Memory
435954 2021-06-24T02:33:13 Z cgiosy Biochips (IZhO12_biochips) C++17
100 / 100
 204 ms 10776 KB 
// gs14004's code test
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
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];
 
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    for (int i=1, w[200005]; i<=n; i++) {
        int p;
        cin>>p>>w[i];inp[i]=w[i];
        if(p) g[p].push_back(i);
        else root = 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];
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5708 KB Output is correct
2 Correct 4 ms 5708 KB Output is correct
3 Correct 4 ms 5708 KB Output is correct
4 Correct 8 ms 6092 KB Output is correct
5 Correct 8 ms 6060 KB Output is correct
6 Correct 9 ms 6092 KB Output is correct
7 Correct 128 ms 9820 KB Output is correct
8 Correct 114 ms 9736 KB Output is correct
9 Correct 157 ms 10304 KB Output is correct
10 Correct 204 ms 10776 KB Output is correct