Submission #1035325

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035325		Andrey	Jobs (BOI24_jobs)	C++14	100 / 100	229 ms	96708 KiB

Main

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

vector<long long> haha[400001];
vector<long long> c(400001);
vector<long long> dp(400001);
vector<long long> wow(400001);
priority_queue<pair<long long,long long>> idk[400001];

void dfs(long long a) {
    for(long long v: haha[a]) {
        dfs(v);
    }
    long long br = 0;
    idk[a].push({0,a});
    wow[a] = c[a];
    while(!idk[a].empty()) {
        pair<long long,long long> b = idk[a].top();
        idk[a].pop();
        if(b.first == LLONG_MAX) {
            break;
        }
        dp[a] = max(dp[a],-br-b.first);
        br+=wow[b.second];
        if(idk[b.second].size() > idk[a].size()) {
            swap(idk[b.second],idk[a]);
        }
        if(b.second != a) {
            while(!idk[b.second].empty()) {
                idk[a].push(idk[b.second].top());
                idk[b.second].pop();
            }
        }
        if(b.second == a) {
            for(int v: haha[a]) {
                idk[a].push({-dp[v],v});
            }
        }
        if(br > 0) {
            break;
        }
    }
    if(br <= 0) {
        dp[a] = LLONG_MAX;
    }
    else {
        wow[a] = br;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    long long n,s,p;
    cin >> n >> s;
    for(long long i = 1; i <= n; i++) {
        cin >> c[i] >> p;
        haha[p].push_back(i);
    }
    dfs(0);
    long long ans = s,br = s;
    priority_queue<pair<long long,long long>> idk;
    idk.push({-dp[0],0});
    while(!idk.empty()) {
        pair<long long,long long> b = idk.top();
        idk.pop();
        if(b.first > br) {
            break;
        }
        br+=c[b.second];
        ans = max(ans,br);
        for(long long v: haha[b.second]) {
            idk.push({-dp[v],v});
        }
    }
    cout << ans-s;
    return 0;
}

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