제출 #1309819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309819		harryleee	Jobs (BOI24_jobs)	C++20	14 / 100	2097 ms	60292 KiB

Main

#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5;
int n;
long long init, res;
pair<long long, int> a[maxn + 1];
vector<int> adj[maxn + 1];
vector<pair<long long, long long>> vec[maxn + 1];

inline void DFS(int u){
    for (int v : adj[u])
        DFS(v);

    for (int v : adj[u]){
        if (vec[v].size() > vec[u].size()) 
            swap(vec[v], vec[u]);
        for (pair<long long, long long> x : vec[v])
            vec[u].push_back(x);
    }
    sort(vec[u].begin(), vec[u].end(), [](pair<long long, long long> x, pair<long long, long long> y){
        return x.first < y.first || (x.first == y.first && x.second < y.second);
    });

    pair<long long, long long> cur = {min(0LL, a[u].first), a[u].first};
    while(!vec[u].empty() && cur.second <= 0){
        auto [cost, earn] = vec[u].back();
        vec[u].pop_back();

        cur.first = min(cur.first, cur.second + cost);
        cur.second += earn;
    }

    if (cur.second > 0) vec[u].push_back(cur);
    return;
}

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

    cin >> n >> init;
    for (int i = 1; i <= n; ++i){
        cin >> a[i].first >> a[i].second;
        adj[a[i].second].push_back(i);
    }

    DFS(0);
    sort(vec[0].begin(), vec[0].end(), [](pair<long long, long long> x, pair<long long, long long> y){
        return x.first < y.first || (x.first == y.first && x.second < y.second);
    });
    while(!vec[0].empty()){
        auto [cost, earn] = vec[0].back();
        vec[0].pop_back();

        if (init + res + cost < 0) break;
        res += earn;
    }
    cout << res;

    return 0;
}

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