Submission #998564

#	Time	Username	Problem	Language	Result	Execution time	Memory
998564		vjudge1	Jobs (BOI24_jobs)	C++17	0 / 100	139 ms	20948 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void DFS(int v, vector<vector<int>>& adj, vector<ll>& dp, vector<int>& x){
	for(int node : adj[v]){
		DFS(node, adj, dp, x);
	}
	if(x[v] >= 0) dp[v] = 0;
	else{
		for(int node : adj[v]){
			dp[v] = min(dp[v], dp[node]);
		}
		dp[v] += -x[v]; //I'm defining cost here, so it's positive. Less is better.
	}
}

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

	int N; ll s; cin >> N >> s;
	ll orgs = s;
	vector<int> x(N), p(N);
	vector<vector<int>> adj(N);
	for(int i = 0; i < N; i++){
		cin >> x[i] >> p[i]; p[i]--;
		if(p[i] != -1){
			adj[p[i]].push_back(i);
		}
	}
	vector<ll> dp(N, 2e18); //Min cost until profit.
	for(int i = 0; i < N; i++){
		if(p[i] == -1) DFS(i, adj, dp, x);
	}
	priority_queue<pair<ll, int>> q;
	for(int i = 0; i < N; i++){
		if(p[i] == -1){
			q.push({-dp[i], i});
		}
	}
	while(!q.empty() && -q.top().first <= s){
		int v = q.top().second; q.pop();
		s += x[v];
		for(int node : adj[v]){
			q.push({-dp[node], node});
		}
	}
	cout << s - orgs << "\n";
}

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