제출 #1182780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182780		steveonalex	Jobs (BOI24_jobs)	C++20	0 / 100	2103 ms	338980 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct ConvolutedSet{
    set<pair<ll, ll>> S;

    void add(pair<ll, ll> i){
        while(true){
            auto it = S.upper_bound(i);
            if (it != S.begin()){
                it--;
                pair<ll, ll> prev = *it;
                if (prev.first + prev.second >= i.first){
                    S.erase(it);
                    prev.second += i.second;
                    i = prev;
                }
                else break;
            }
            else break;
        }

        while(true){
            auto it = S.upper_bound(i);
            if (it != S.end()){
                pair<ll, ll> nxt = *it;
                if (i.first + i.second >= nxt.first){
                    S.erase(it);
                    i.second += nxt.second;
                }
                else break;
            }
            else break;
        }
        S.insert(i);
    }

    int size(){
        return S.size();
    }

    pair<ll, ll> top(){
        return *S.begin();
    }

    void pop(){
        S.erase(S.begin());
    }
};

const int N = 3e5 + 69;
int n; ll s;
vector<int> graph[N];
int p[N];
ll a[N];
ConvolutedSet dp[N];

void dfs(int u){
    for(int v: graph[u]) {
        dfs(v);
        if (dp[u].size() < dp[v].size()) swap(dp[u], dp[v]);
        for(pair<ll, ll> i: dp[v].S) 
            dp[u].add(i);
    }


    if (a[u] >= 0){
        dp[u].add(make_pair(0, a[u]));
    }
    else{
        ll sum = a[u];
        while(dp[u].size()){
            pair<ll, ll> v = dp[u].top(); dp[u].pop();
            sum += v.second;
            if (sum > 0){
                dp[u].add(make_pair(v.first - (sum - v.second), sum));
                break;
            }
        }
    }

    // cout << "Node: " << u << "\n";
    // for(auto i: dp[u].S) cout << "(" << i.first << ", " << i.second << ")\n";

}

void solve(){
    cin >> n >> s;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i] >> p[i];
        graph[p[i]].push_back(i);
    }

    dfs(0);

    for(ll w = 0; w <= s; ++w){
        ll cur = w;
        ll ans = 0;
        for(auto i: dp[0].S) if (cur >= i.first) {
            ans += i.second;
            cur += i.second;
        }

        cout << ans << "\n";
    }
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

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