oj.uz

답안 #702508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702508 2023-02-24T08:22:52 Z Darren0724 바이오칩 (IZhO12_biochips) C++17
100 / 100
 951 ms 407012 KB 
#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
const int N=200000;
int n,k;
vector<int> v(N);
vector<vector<int>> adj(N);
vector<vector<int>> dp(N,vector<int>(501));
vector<int> leaf(N);
void dfs(int k){
    if(adj[k].size()==0){
        leaf[k]=1;
    }
    for(int u:adj[k]){
        dfs(u);
        leaf[k]+=leaf[u];
        for(int i=min(leaf[k],500);i>0;i--){
            for(int j=1;j<=min(leaf[u],i);j++){
                dp[k][i]=max(dp[k][i],dp[u][j]+dp[k][i-j]);
            }
        }
    }
    dp[k][1]=max(dp[k][1],v[k]);
    return;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int root=0;
    cin>>n>>k;
    for(int i=0;i<n;i++){
        int p;cin>>p;p--;
        if(p!=-1){
            adj[p].push_back(i);
        }
        else{
            root=i;
        }
        cin>>v[i];
    }
    dfs(root);
    cout<<dp[root][k]<<endl;

    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 193 ms 405692 KB Output is correct
2 Correct 196 ms 405744 KB Output is correct
3 Correct 195 ms 405708 KB Output is correct
4 Correct 211 ms 405920 KB Output is correct
5 Correct 218 ms 405944 KB Output is correct
6 Correct 214 ms 405916 KB Output is correct
7 Correct 473 ms 406924 KB Output is correct
8 Correct 476 ms 407012 KB Output is correct
9 Correct 886 ms 406912 KB Output is correct
10 Correct 951 ms 406800 KB Output is correct