Submission #994958

#	Time	Username	Problem	Language	Result	Execution time	Memory
994958		pavement	Jobs (BOI24_jobs)	C++17	69 / 100	189 ms	55380 KiB

Main

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

#define mp make_pair
#define pb push_back

using ll = long long;
using ll2 = pair<ll, ll>;

int N, x[300005];
ll s, profit;
vector<int> adj[300005];
priority_queue<ll2, vector<ll2>, greater<ll2> > pq[300005];

void dfs(int u) {
	for (auto v : adj[u]) {
		dfs(v);
		if (pq[u].size() < pq[v].size()) {
			swap(pq[u], pq[v]);
		}
		while (!pq[v].empty()) {
			pq[u].push(pq[v].top());
			pq[v].pop();
		}
	}
	if (x[u] >= 0) {
		pq[u].emplace(0, x[u]);
	} else {
		ll r = -x[u], p = x[u];
		while (!pq[u].empty() && r + p >= pq[u].top().first) {
			p += pq[u].top().second;
			pq[u].pop();
		}
		while (!pq[u].empty() && p < 0) {
			auto [nr, np] = pq[u].top();
			r = max(r, nr - p);
			p += np;
			pq[u].pop();
		}
		if (p >= 0) {
			pq[u].emplace(r, p);
		} else {
			assert(pq[u].empty());
		}
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> s;
	for (int i = 1, p; i <= N; i++) {
		cin >> x[i] >> p;
		adj[p].pb(i);
	}
	dfs(0);
	while (!pq[0].empty() && s >= pq[0].top().first && pq[0].top().second >= 0) {
		s += pq[0].top().second;
		profit += pq[0].top().second;
		pq[0].pop();
	}
	cout << profit << '\n';
}

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