oj.uz

Submission #13289

# Submission time Handle Problem Language Result Execution time Memory
13289 2015-02-10T08:18:16 Z gs14004 Biochips (IZhO12_biochips) C++14
100 / 100
 316 ms 10744 KB 
#include <cstdio>
#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 main(){
    int dp[2][200005] = {};
    scanf("%d %d",&n,&m);
    for (int i=1; i<=n; i++) {
        int p;
        scanf("%d %d",&p,&inp[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]);
        }
    }
    printf("%d",dp[m%2][1]);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9680 KB Output is correct
2 Correct 3 ms 9680 KB Output is correct
3 Correct 0 ms 9688 KB Output is correct
4 Correct 3 ms 9816 KB Output is correct
5 Correct 0 ms 9680 KB Output is correct
6 Correct 0 ms 9684 KB Output is correct
7 Correct 171 ms 10744 KB Output is correct
8 Correct 177 ms 10740 KB Output is correct
9 Correct 244 ms 10636 KB Output is correct
10 Correct 316 ms 10640 KB Output is correct