제출 #995133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995133		LCJLY	Jobs (BOI24_jobs)	C++14	11 / 100	313 ms	100432 KiB

Main

#include <bits/stdc++.h>
using namespace std;
	
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
 
vector<int>adj[300005];
int arr[300005];
multiset<pii>se[300005];
int ans=0;
 
void dfs(int index){
	for(auto it:adj[index]){
		dfs(it);
		//for(auto ii:se[it]) se[index].insert(ii);
		if(se[index].size()<se[it].size()) swap(se[index],se[it]);
		for(auto ii:se[it]) se[index].insert(ii);
	}
 
	//big small
	int counter=arr[index];
	int need=max(0LL,-arr[index]);
	while(counter<0){
		if(se[index].empty()) break;
		//greedily take the smallest 
		pii hold=*se[index].begin();
		se[index].erase(se[index].begin());
		counter+=hold.second;
		need=max(need,-counter+hold.first);
	}
	if(counter>0){
		//consuming
		while(!se[index].empty()&&se[index].begin()->first<need){
			counter+=se[index].begin()->second;
			se[index].erase(se[index].begin());
		}
		se[index].insert({need,counter});
	}
	ans=counter;
	//show(index,index);
	//for(auto it:se[index]){
		//cout << it.first << " " << it.second << endl;
	//}
}
 
void solve(){	
	int n,m;
	cin >> n >> m;
	
	int temp,temp2;
	for(int x=1;x<=n;x++){
		cin >> temp >> temp2;
		arr[x]=temp;
		adj[temp2].push_back(x);
	}
	arr[0]=0;
	dfs(0);
	int cur=m;
	while(!se[0].empty()&&se[0].begin()->first<=cur){
		//pii hold=*se[0].begin();
		//show2(hold.first,hold.first,hold.second,hold.second);
		cur+=se[0].begin()->second;
		se[0].erase(se[0].begin());
	}
	//show(cur,cur);
	cout << cur-m;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	//freopen("in.txt","r",stdin);
	while(t--){
		solve();
	}
}

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