oj.uz

Submission #998592

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

using namespace std;

typedef long long ll;
#define int long long

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 916 ms 23248 KB Output is correct
2 Correct 137 ms 24008 KB Output is correct
3 Correct 115 ms 22728 KB Output is correct
4 Execution timed out 2076 ms 30280 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 14 ms 796 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 13 ms 800 KB Output is correct
18 Correct 6 ms 712 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 13 ms 796 KB Output is correct
24 Correct 7 ms 720 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 552 KB Output is correct
28 Correct 6 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 14 ms 796 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 13 ms 800 KB Output is correct
18 Correct 6 ms 712 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 13 ms 796 KB Output is correct
24 Correct 7 ms 720 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 552 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 156 ms 23860 KB Output is correct
30 Correct 94 ms 23604 KB Output is correct
31 Correct 83 ms 24100 KB Output is correct
32 Execution timed out 2059 ms 52048 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 14 ms 796 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 13 ms 800 KB Output is correct
18 Correct 6 ms 712 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 13 ms 796 KB Output is correct
24 Correct 7 ms 720 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 552 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Incorrect 1 ms 604 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 916 ms 23248 KB Output is correct
2 Correct 137 ms 24008 KB Output is correct
3 Correct 115 ms 22728 KB Output is correct
4 Execution timed out 2076 ms 30280 KB Time limit exceeded
5 Halted 0 ms 0 KB -