Submission #1097824

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097824		anhthi	Jobs (BOI24_jobs)	C++14	100 / 100	145 ms	61212 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define heap priority_queue
 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 5e5 + 5;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n; ll s;
ll cost[N], par[N];

heap<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq[N];

int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    cin >> n >> s;
    rep(i, n) cin >> cost[i] >> par[i];

    ford(i, n, 0) {
        ll profit = cost[i];
        ll min_start = max(0LL, -cost[i]);

        while (sz(pq[i]) && profit <= 0) {
            pair<ll, ll> top = pq[i].top(); pq[i].pop();
            maximize(min_start, top.first - profit); profit += top.second;
        }
        while (sz(pq[i])) {
            pair<ll, ll> top = pq[i].top(); 
            if (top.first > min_start + profit) break;
            profit += top.second; 
            pq[i].pop();
        }
        if (profit > 0) pq[i].push(mp(min_start, profit));

        int p = par[i];
        if (!i) continue;

        if (sz(pq[p]) < sz(pq[i])) pq[p].swap(pq[i]);

        while (sz(pq[i])) {
            pq[p].push(pq[i].top());
            pq[i].pop();
        }

    } 

    ll res = s;
    while (sz(pq[0]) && pq[0].top().first <= res) 
        res += pq[0].top().second, pq[0].pop();
    cout << res - s;

    return 0;
}

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