oj.uz

Submission #991302

# Submission time Handle Problem Language Result Execution time Memory
991302 2024-06-01T20:26:58 Z VMaksimoski008 Jobs (BOI24_jobs) C++17
11 / 100
 68 ms 25936 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e5 + 5;
const double eps = 1e-9;

int n;
ll val[maxn], S;
vector<int> graph[maxn];

ll dfs(int u) {
    ll sum = val[u];
    for(int &v : graph[u]) sum += dfs(v);
    return max(0ll, sum);
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    cin >> n >> S;
    for(int i=1; i<=n; i++) {
        cin >> val[i];
        int p;
        cin >> p;
        graph[p].push_back(i);
    }

    cout << dfs(0) << '\n';
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 21992 KB Output is correct
2 Correct 55 ms 20560 KB Output is correct
3 Correct 50 ms 19788 KB Output is correct
4 Correct 58 ms 24660 KB Output is correct
5 Correct 53 ms 25936 KB Output is correct
6 Correct 42 ms 16732 KB Output is correct
7 Correct 67 ms 20724 KB Output is correct
8 Correct 56 ms 20812 KB Output is correct
9 Correct 63 ms 23892 KB Output is correct
10 Correct 50 ms 25424 KB Output is correct
11 Correct 66 ms 21844 KB Output is correct
12 Correct 59 ms 19336 KB Output is correct
13 Correct 65 ms 20248 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 8792 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 8792 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 8792 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 21992 KB Output is correct
2 Correct 55 ms 20560 KB Output is correct
3 Correct 50 ms 19788 KB Output is correct
4 Correct 58 ms 24660 KB Output is correct
5 Correct 53 ms 25936 KB Output is correct
6 Correct 42 ms 16732 KB Output is correct
7 Correct 67 ms 20724 KB Output is correct
8 Correct 56 ms 20812 KB Output is correct
9 Correct 63 ms 23892 KB Output is correct
10 Correct 50 ms 25424 KB Output is correct
11 Correct 66 ms 21844 KB Output is correct
12 Correct 59 ms 19336 KB Output is correct
13 Correct 65 ms 20248 KB Output is correct
14 Incorrect 2 ms 8792 KB Output isn't correct
15 Halted 0 ms 0 KB -