oj.uz

Submission #995370

# Submission time Handle Problem Language Result Execution time Memory
995370 2024-06-08T23:39:16 Z PagodePaiva Jobs (BOI24_jobs) C++17
11 / 100
 165 ms 28148 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;
const int N = 300010;
vector <int> g[N];
vector <int> raizes;
int val[N];
int dp[N];

int dfs(int v, int p){
    int con = 0;
    for(auto x : g[v]){
        if(x == p) continue;
        dfs(x, v);
        con++;
    }
    if(con == 0)
        return dp[v] = max(0LL, val[v]);
    int vl = val[v];
    for(auto x : g[v]){
        if(x == p) continue;
        vl += dp[x];
    }
    dp[v] = max(vl, 0LL);
    return dp[v];
}

int32_t main(){
    int n, c;
    cin >> n >> c;
    if(c >= 1e18){
        for(int i = 1;i <= n;i++){
            int p;
            cin >> val[i] >> p;
            if(p == 0) raizes.push_back(i);
            else g[p].push_back(i);
        }
        int res = 0;
        for(auto x : raizes){
            res += dfs(x, x);
        }
        cout << res << '\n';
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 20296 KB Output is correct
2 Correct 130 ms 19368 KB Output is correct
3 Correct 122 ms 18888 KB Output is correct
4 Correct 142 ms 25160 KB Output is correct
5 Correct 145 ms 27984 KB Output is correct
6 Correct 91 ms 16980 KB Output is correct
7 Correct 136 ms 19540 KB Output is correct
8 Correct 141 ms 18880 KB Output is correct
9 Correct 113 ms 26964 KB Output is correct
10 Correct 130 ms 28148 KB Output is correct
11 Correct 165 ms 19540 KB Output is correct
12 Correct 136 ms 18512 KB Output is correct
13 Correct 156 ms 19536 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 20296 KB Output is correct
2 Correct 130 ms 19368 KB Output is correct
3 Correct 122 ms 18888 KB Output is correct
4 Correct 142 ms 25160 KB Output is correct
5 Correct 145 ms 27984 KB Output is correct
6 Correct 91 ms 16980 KB Output is correct
7 Correct 136 ms 19540 KB Output is correct
8 Correct 141 ms 18880 KB Output is correct
9 Correct 113 ms 26964 KB Output is correct
10 Correct 130 ms 28148 KB Output is correct
11 Correct 165 ms 19540 KB Output is correct
12 Correct 136 ms 18512 KB Output is correct
13 Correct 156 ms 19536 KB Output is correct
14 Incorrect 2 ms 7772 KB Output isn't correct
15 Halted 0 ms 0 KB -