Submission #991606

#	Time	Username	Problem	Language	Result	Execution time	Memory
991606		VMaksimoski008	Jobs (BOI24_jobs)	C++17	11 / 100	71 ms	26380 KiB

Main

#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>;
using Node = array<ll, 3>;
 
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, sub[maxn], req[maxn];
vector<int> graph[maxn];
 
ll dfs(int u) {
    ll sum = val[u];
    for(int &v : graph[u]) sum += dfs(v);
    return max(0ll, sum);
}

void dfs2(int u, int p) {
    sub[u] = val[u];
    req[u] = max(0ll, -val[u]);

    for(int &v : graph[u]) {
        dfs2(v, u);
        sub[u] += sub[v];
    }
}
 
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);
    }

    if(S == 1e18) {
        cout << dfs(0) << '\n';
        return 0;
    }
 
    //line glhf
    priority_queue<Node, vector<Node>, greater<Node> > pq;
    for(int &x : graph[0]) {
        dfs2(x, 0);
        pq.push({ req[x], sub[x] });
    }

    ll ans = S, curr = S;

    while(!pq.empty()) {
        auto [need, can, u] = pq.top(); pq.pop();
        ans = max(ans, curr);

        if(val[u] >= 0) curr += val[u];
        
        if(curr >= need) {
            if(val[u] < 0) curr += val[u];
            if(graph[u].size() > 0) {
                int nxt = graph[u][0];
                pq.push({ req[nxt], sub[nxt], nxt });
            }
        }

    }   

    cout << ans - S << '\n';
    return 0;
}

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