oj.uz

답안 #90368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90368 2018-12-21T11:28:28 Z popovicirobert 바이오칩 (IZhO12_biochips) C++14
0 / 100
 487 ms 296680 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

const int INF = 2e9;
const int MAXN = (int) 2e5;
const int MAXM = 500;

vector <int> g[MAXN + 1];
int vals[MAXN + 1], weight[MAXN + 1];

int dp[MAXN + 1][MAXM + 1];
int m;

void dfs(int nod) {
    for(int i = 1; i <= m; i++) {
        dp[nod][i] = -INF;
    }
    for(auto it : g[nod]) {
        dfs(it);
        for(int i = min(weight[nod], m); i >= 0; i--) {
            for(int j = min(weight[it], m); j >= 0; j--) {
                if(dp[nod][i] >= 0 && dp[it][j] >= 0) {
                    dp[nod][i + j] = max(dp[nod][i + j], dp[nod][i] + dp[it][j]);
                }
            }
        }
        weight[nod] += weight[it];
    }
    weight[nod]++;
    dp[nod][1] = max(dp[nod][1], vals[nod]);
}

int main() {
    //ifstream cin("B.in");
    //ofstream cout("B.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    int root;
    for(i = 1; i <= n; i++) {
        int par;
        cin >> par >> vals[i];
        g[par].push_back(i);
        if(par == 0) {
            root = i;
        }
    }
    dfs(root);
    cout << dp[root][m];
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

biochips.cpp: In function 'int main()':
biochips.cpp:56:23: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
     cout << dp[root][m];
                       ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 12 ms 5244 KB Output is correct
3 Correct 6 ms 5296 KB Output is correct
4 Correct 24 ms 22888 KB Output is correct
5 Correct 26 ms 25124 KB Output is correct
6 Correct 27 ms 25124 KB Output is correct
7 Incorrect 487 ms 296680 KB Output isn't correct
8 Halted 0 ms 0 KB -