Submission #1233576

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233576		Ariadna	Jobs (BOI24_jobs)	C++20	11 / 100	160 ms	25888 KiB

Main

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 3e5+1;
vector<int> adj[N];
int x[N], p[N];
ll dp[N];

ll dfs(int u) {
    dp[u] = x[u];
    for (int v: adj[u]) {
        dp[u] += dfs(v);
    }
    dp[u] = max(dp[u], 0LL);
    return dp[u];
}

int main() {
    int n;
    ll s;
    cin >> n >> s;
    queue<int> root;
    for (int i = 1; i <= n; ++i) {
        cin >> x[i] >> p[i];
        adj[p[i]].push_back(i);
    }
    cout << dfs(0) << endl;

    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31