Submission #1058953

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058953		Tonyl	Jobs (BOI24_jobs)	C++17	0 / 100	1096 ms	29884 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using vi = vector<int>;
using pi = pair<ll,ll>;
#define REP(i,n) for (int i = 0; i < n; i++)
#define trav(a,x) for (auto& a : x)
#define D(x) cerr << #x << ": " << x << endl;
#define all(x) (x).begin(), (x).end()

const int MAX_N = 3*1e5+3;

struct Info {
    ll off = 0;
    map<ll, ll> rew;

    void add(int r) {
        if (r == 0) return;
        if (r > 0) {
            rew[-off] += r;
        } else {
            r*=-1;
            off += r;
            // go erasing
            while (rew.size() && r) {
                if (rew.begin()->second > r) {
                    rew.begin()->second -= r;
                    r = 0;
                } else {
                    r -= rew.begin()->second;
                    rew.erase(rew.begin());
                }
            }
        }
    }

    void merge(Info* other) {
        trav(o, other->rew) {
            ll re = o.first + other->off;
            rew[re-off] += o.second;
        }
    }
};

int n; ll s;
vi children[MAX_N];
int values[MAX_N];
bool done[MAX_N];
priority_queue<pi, vector<pi>, greater<pi>> q;

void dfs(int i, ll neq, ll pos, bool prev_pos) {
    done[i] = 1;

    if (values[i] >= 0) pos += values[i];

    if ((values[i] < 0 && prev_pos) || children[i].size() == 0) {
        if (pos > neq) {
            q.push({neq, pos-neq});
            pos = neq;
        }
    }

    if (values[i] < 0) neq += -values[i];

    if (children[i].size())
        dfs(children[i][0], neq, pos, values[i]>=0);
}

ll triv_dfs(int i) {
    done[i] = 1;
    ll tot = values[i];
    trav(ch, children[i]) tot += triv_dfs(ch);
    return max(tot, 0ll);
}

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

    cin >> n >> s;
    ll ss = s;

    REP(i,n) {
        int p; cin >> values[i] >> p;
        if (p == 0) continue;
        p--;

        children[p].push_back(i);
    }

    REP(i,n) {
        if (done[i]) continue;
        dfs(i,0,0,0);
    }

    while (q.size()) {
        auto r = q.top(); q.pop();
        D(r.first);
        D(r.second);
        if (r.first <= s) s += r.second;
        //else break;
    }

    assert(s >= ss);
    cout << s - ss << endl;
    return 0;
}

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