oj.uz

답안 #999086

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999086 2024-06-15T06:24:05 Z esomer Jobs (BOI24_jobs) C++17
100 / 100
 341 ms 104656 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, vector<multiset<pair<ll, ll>>>& stack){
	for(int node : adj[v]){
		DFS(node, adj, dp, x, stack);
		if((int)stack[node].size() > (int)stack[v].size()) swap(stack[node], stack[v]);
		for(pair<ll, ll> pr : stack[node]){ //Not so complex now, as I am maintaining sum only.
			stack[v].insert(pr);
		}
	}
	// cout << "v "<< v << " stack:\n";
	// for(pair<int, int> pr : stack[v]) cout << pr.first << " "<< pr.second << "\n";
	ll minPre = max(0, -x[v]); //The max 0 is just if it's positive. For convenience, i don't want it to be neg. 
	ll sum = x[v];
	while(sum <= 0 && !stack[v].empty()){
		pair<ll, ll> pr = *stack[v].begin(); stack[v].erase(stack[v].begin());
		minPre = max(minPre, pr.first - sum); sum += pr.second;
	}
	if(sum <= 0){
		//Here the stack is already empty.
		return;
	}
	//Now, because I am the root, my children can't be taken without me, so I need to erase the ones
	//with minPre lower than mine.
	while(!stack[v].empty() && (*stack[v].begin()).first < minPre){
		pair<ll, ll> pr = *stack[v].begin(); stack[v].erase(stack[v].begin());
		sum += pr.second;
	}
	stack[v].insert({minPre, sum});
	// cout << "v "<< v << " stack:\n";
	// for(pair<int, int> pr : stack[v]) cout << pr.first << " "<< pr.second << "\n";
	dp[v] = minPre;
	// cout << "dp "<< dp[v] << "\n";
}

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); //Min cost until profit.
	vector<multiset<pair<ll, ll>>> stack(N);
	for(int i = 0; i < N; i++){
		if(p[i] == -1) DFS(i, adj, dp, x, stack);
	}
	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
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 341 ms 96576 KB Output is correct
2 Correct 240 ms 62920 KB Output is correct
3 Correct 143 ms 44492 KB Output is correct
4 Correct 143 ms 57808 KB Output is correct
5 Correct 118 ms 66128 KB Output is correct
6 Correct 132 ms 48464 KB Output is correct
7 Correct 268 ms 72904 KB Output is correct
8 Correct 153 ms 44544 KB Output is correct
9 Correct 138 ms 62920 KB Output is correct
10 Correct 101 ms 67404 KB Output is correct
11 Correct 304 ms 97044 KB Output is correct
12 Correct 237 ms 78028 KB Output is correct
13 Correct 250 ms 88208 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 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 1 ms 860 KB Output is correct
12 Correct 1 ms 884 KB Output is correct
13 Correct 1 ms 600 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 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 604 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 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 860 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 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 1 ms 860 KB Output is correct
12 Correct 1 ms 884 KB Output is correct
13 Correct 1 ms 600 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 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 604 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 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 99 ms 44924 KB Output is correct
30 Correct 113 ms 44760 KB Output is correct
31 Correct 110 ms 44996 KB Output is correct
32 Correct 111 ms 84016 KB Output is correct
33 Correct 107 ms 66020 KB Output is correct
34 Correct 91 ms 54868 KB Output is correct
35 Correct 40 ms 22112 KB Output is correct
36 Correct 105 ms 48384 KB Output is correct
37 Correct 97 ms 44932 KB Output is correct
38 Correct 119 ms 85584 KB Output is correct
39 Correct 108 ms 68008 KB Output is correct
40 Correct 101 ms 51284 KB Output is correct
41 Correct 76 ms 44252 KB Output is correct
42 Correct 40 ms 27864 KB Output is correct
43 Correct 107 ms 57228 KB Output is correct
44 Correct 119 ms 85584 KB Output is correct
45 Correct 102 ms 67924 KB Output is correct
46 Correct 90 ms 55888 KB Output is correct
47 Correct 112 ms 44372 KB Output is correct
48 Correct 110 ms 44228 KB Output is correct
49 Correct 98 ms 44184 KB Output is correct
50 Correct 118 ms 85708 KB Output is correct
51 Correct 70 ms 48744 KB Output is correct
52 Correct 95 ms 52048 KB Output is correct
53 Correct 65 ms 38772 KB Output is correct
54 Correct 105 ms 44228 KB Output is correct
55 Correct 97 ms 44372 KB Output is correct
56 Correct 119 ms 85584 KB Output is correct
57 Correct 115 ms 66380 KB Output is correct
58 Correct 92 ms 52044 KB Output is correct
59 Correct 95 ms 51024 KB Output is correct
60 Correct 65 ms 44228 KB Output is correct
61 Correct 101 ms 55236 KB Output is correct
62 Correct 109 ms 53332 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 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 1 ms 860 KB Output is correct
12 Correct 1 ms 884 KB Output is correct
13 Correct 1 ms 600 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 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 604 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 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 532 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 860 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 792 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 860 KB Output is correct
47 Correct 1 ms 860 KB Output is correct
48 Correct 1 ms 860 KB Output is correct
49 Correct 1 ms 860 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 2 ms 604 KB Output is correct
53 Correct 1 ms 860 KB Output is correct
54 Correct 1 ms 860 KB Output is correct

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 341 ms 96576 KB Output is correct
2 Correct 240 ms 62920 KB Output is correct
3 Correct 143 ms 44492 KB Output is correct
4 Correct 143 ms 57808 KB Output is correct
5 Correct 118 ms 66128 KB Output is correct
6 Correct 132 ms 48464 KB Output is correct
7 Correct 268 ms 72904 KB Output is correct
8 Correct 153 ms 44544 KB Output is correct
9 Correct 138 ms 62920 KB Output is correct
10 Correct 101 ms 67404 KB Output is correct
11 Correct 304 ms 97044 KB Output is correct
12 Correct 237 ms 78028 KB Output is correct
13 Correct 250 ms 88208 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 856 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 1 ms 604 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 884 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 99 ms 44924 KB Output is correct
43 Correct 113 ms 44760 KB Output is correct
44 Correct 110 ms 44996 KB Output is correct
45 Correct 111 ms 84016 KB Output is correct
46 Correct 107 ms 66020 KB Output is correct
47 Correct 91 ms 54868 KB Output is correct
48 Correct 40 ms 22112 KB Output is correct
49 Correct 105 ms 48384 KB Output is correct
50 Correct 97 ms 44932 KB Output is correct
51 Correct 119 ms 85584 KB Output is correct
52 Correct 108 ms 68008 KB Output is correct
53 Correct 101 ms 51284 KB Output is correct
54 Correct 76 ms 44252 KB Output is correct
55 Correct 40 ms 27864 KB Output is correct
56 Correct 107 ms 57228 KB Output is correct
57 Correct 119 ms 85584 KB Output is correct
58 Correct 102 ms 67924 KB Output is correct
59 Correct 90 ms 55888 KB Output is correct
60 Correct 112 ms 44372 KB Output is correct
61 Correct 110 ms 44228 KB Output is correct
62 Correct 98 ms 44184 KB Output is correct
63 Correct 118 ms 85708 KB Output is correct
64 Correct 70 ms 48744 KB Output is correct
65 Correct 95 ms 52048 KB Output is correct
66 Correct 65 ms 38772 KB Output is correct
67 Correct 105 ms 44228 KB Output is correct
68 Correct 97 ms 44372 KB Output is correct
69 Correct 119 ms 85584 KB Output is correct
70 Correct 115 ms 66380 KB Output is correct
71 Correct 92 ms 52044 KB Output is correct
72 Correct 95 ms 51024 KB Output is correct
73 Correct 65 ms 44228 KB Output is correct
74 Correct 101 ms 55236 KB Output is correct
75 Correct 109 ms 53332 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 860 KB Output is correct
78 Correct 1 ms 860 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 1 ms 604 KB Output is correct
81 Correct 1 ms 860 KB Output is correct
82 Correct 1 ms 856 KB Output is correct
83 Correct 1 ms 860 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 532 KB Output is correct
87 Correct 1 ms 860 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 860 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 792 KB Output is correct
92 Correct 1 ms 604 KB Output is correct
93 Correct 1 ms 860 KB Output is correct
94 Correct 1 ms 860 KB Output is correct
95 Correct 1 ms 860 KB Output is correct
96 Correct 1 ms 860 KB Output is correct
97 Correct 1 ms 604 KB Output is correct
98 Correct 2 ms 604 KB Output is correct
99 Correct 2 ms 604 KB Output is correct
100 Correct 1 ms 860 KB Output is correct
101 Correct 1 ms 860 KB Output is correct
102 Correct 260 ms 83924 KB Output is correct
103 Correct 256 ms 70524 KB Output is correct
104 Correct 160 ms 50628 KB Output is correct
105 Correct 103 ms 43724 KB Output is correct
106 Correct 152 ms 69320 KB Output is correct
107 Correct 91 ms 58720 KB Output is correct
108 Correct 277 ms 97232 KB Output is correct
109 Correct 105 ms 35284 KB Output is correct
110 Correct 162 ms 56012 KB Output is correct
111 Correct 174 ms 52900 KB Output is correct
112 Correct 148 ms 43472 KB Output is correct
113 Correct 131 ms 58780 KB Output is correct
114 Correct 106 ms 68300 KB Output is correct
115 Correct 112 ms 38228 KB Output is correct
116 Correct 299 ms 86328 KB Output is correct
117 Correct 221 ms 60328 KB Output is correct
118 Correct 163 ms 50124 KB Output is correct
119 Correct 127 ms 42952 KB Output is correct
120 Correct 123 ms 60624 KB Output is correct
121 Correct 97 ms 57168 KB Output is correct
122 Correct 332 ms 103880 KB Output is correct
123 Correct 286 ms 82380 KB Output is correct
124 Correct 171 ms 58060 KB Output is correct
125 Correct 200 ms 51912 KB Output is correct
126 Correct 124 ms 44556 KB Output is correct
127 Correct 68 ms 30292 KB Output is correct
128 Correct 41 ms 27444 KB Output is correct
129 Correct 334 ms 104656 KB Output is correct
130 Correct 286 ms 83116 KB Output is correct
131 Correct 236 ms 66232 KB Output is correct
132 Correct 172 ms 50384 KB Output is correct
133 Correct 138 ms 44432 KB Output is correct
134 Correct 142 ms 69664 KB Output is correct
135 Correct 93 ms 63824 KB Output is correct
136 Correct 316 ms 97088 KB Output is correct
137 Correct 272 ms 99412 KB Output is correct