제출 #1045050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1045050		owoovo	Jobs (BOI24_jobs)	C++17	11 / 100	131 ms	42836 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define pqi priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>
#define F first
#define S second
using namespace std;
const ll maxn=1e18;
ll n,s,pp[300010],p[300010];
vector<int> e[300010];
pqi dfs(int now){
    pqi pq;
    for(auto x:e[now]){
        pqi pq2=dfs(x);
        if(pq.size()<pq2.size())swap(pq,pq2);
        while(!pq2.empty()){
            pq.push(pq2.top());
            pq2.pop();
        }
    }
    ll need=max(0ll,-pp[now]),pf=pp[now];
    while(!pq.empty()&&pf<0){
        auto [x,y]=pq.top();
        pq.pop();
        pf+=y;
        if(x>need+pf){
            need=x-pf;
        }
    }
    while(!pq.empty()&&pq.top().F<=need+pf){
        pf+=pq.top().S;
        pq.pop();
    }
    if(pf>0)pq.push({need,pf});
    return pq;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>s;
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        pp[i]=a;
        p[i]=b;
        e[b].push_back(i);
    }
    pqi pq=dfs(0);
    ll now=s,pf=0;
    while(!pq.empty()&&now+pf>=pq.top().F){
        pf+=pq.top().S;
        pq.pop();
    }
    cout<<pf<<"\n";
    return 0;
}

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