Submission #1054094

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054094		Apiram	Jobs (BOI24_jobs)	C++14	29 / 100	87 ms	71360 KiB

Main

/*
*  author : Apiram                  
*  created: 11.08.2024 14:11:10
*/

#include<bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	long long n,s;cin>>n>>s;
	vector<pair<long long,long long>>arr(n + 1);
	vector<vector<long long>>adj(n + 1);
	for (long long i = 1;i<=n;++i){
		cin>>arr[i].first>>arr[i].second;
		adj[arr[i].second].push_back(i);
	}
	vector<pair<long long,long long>>pos;
	function<int(long long,long long,long long,long long,long long)>dfs = [&](long long u,long long mn,long long cost,long long got,long long mx){
		int ans = 0;
		if (cost - got > 0){
			pos.push_back({mn - max(got,mx),cost - got});	
			got = cost;
			mx = cost;
			ans++;
		}
		for(auto x:adj[u]){
			if (ans){
				got = cost;
			}
			ans += dfs(x,min(mn,cost + arr[x].first),cost + arr[x].first,got,mx);	 			        
		}
		return ans;
	};
	dfs(0,0,0,0,0);
	sort(pos.rbegin(),pos.rend());
	long long k = s;
	for (auto x:pos){
		//cout<<x.first<<" "<<x.second<<'\n';
		if (x.first + k < 0)continue;
		k+=x.second;
	}
	cout<<k - s<<'\n';
	return 0;
}

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