oj.uz

Submission #998594

# Submission time Handle Problem Language Result Execution time Memory
998594 2024-06-14T09:57:06 Z vjudge1 Jobs (BOI24_jobs) C++17
14 / 100
 2000 ms 49744 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = 2e18;

void DFS(int v, vector<vector<int>>& adj, vector<ll>& dp, vector<int>& x, ll minPre, ll currSum, int start){
	currSum += x[v];
	minPre = min(minPre, currSum);
	if(currSum >= 0){
		dp[start] = min(dp[start], -minPre);
	}
	for(int node : adj[v]){
		DFS(node, adj, dp, x, minPre, currSum, start);
	}
}

signed 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, INF);
	for(int i = 0; i < N; i++){
		DFS(i, adj, dp, x, 0, 0, i);
	}
	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.0

# Verdict Execution time Memory Grader output
1 Correct 841 ms 20944 KB Output is correct
2 Correct 124 ms 20936 KB Output is correct
3 Correct 91 ms 20424 KB Output is correct
4 Execution timed out 2032 ms 27988 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 15 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 14 ms 604 KB Output is correct
18 Correct 7 ms 700 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 14 ms 604 KB Output is correct
24 Correct 7 ms 664 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 524 KB Output is correct
28 Correct 7 ms 604 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 15 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 14 ms 604 KB Output is correct
18 Correct 7 ms 700 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 14 ms 604 KB Output is correct
24 Correct 7 ms 664 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 524 KB Output is correct
28 Correct 7 ms 604 KB Output is correct
29 Correct 161 ms 21492 KB Output is correct
30 Correct 95 ms 21204 KB Output is correct
31 Correct 82 ms 21584 KB Output is correct
32 Execution timed out 2056 ms 49744 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 15 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 14 ms 600 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 14 ms 604 KB Output is correct
18 Correct 7 ms 700 KB Output is correct
19 Correct 3 ms 600 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 14 ms 604 KB Output is correct
24 Correct 7 ms 664 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 524 KB Output is correct
28 Correct 7 ms 604 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 1 ms 348 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 841 ms 20944 KB Output is correct
2 Correct 124 ms 20936 KB Output is correct
3 Correct 91 ms 20424 KB Output is correct
4 Execution timed out 2032 ms 27988 KB Time limit exceeded
5 Halted 0 ms 0 KB -