Submission #994614

# Submission time Handle Problem Language Result Execution time Memory
994614 2024-06-08T02:28:51 Z pavement Jobs (BOI24_jobs) C++17
14 / 100
2000 ms 24048 KB
#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back

using ll = long long;

int N, x[300005], p[300005];
ll s, os, wei[300005], mn[300005];
bool seen[300005];
vector<int> adj[300005];

void dfs(int u) {
	wei[u] += x[u];
	mn[u] = min(mn[u], wei[u]);
	for (auto v : adj[u]) {
		wei[v] = wei[u];
		mn[v] = min(mn[v], mn[u]);
		dfs(v);
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> s;
	os = s;
	for (int i = 1; i <= N; i++) {
		cin >> x[i] >> p[i];
		adj[p[i]].pb(i);
	}
	seen[0] = 1;
	while (1) {
		for (int i = 1; i <= N; i++) {
			mn[i] = 0;
		}
		dfs(0);
		pair<ll, int> tk = mp(-1, -1);
		for (int i = 1; i <= N; i++) {
			if (!seen[i] && s + mn[i] >= 0) {
				tk = max(tk, mp(wei[i], i));
			}
		}
		if (tk.first < 0) {
			break;
		}
		s += tk.first;
		for (int j = tk.second; !seen[j]; j = p[j]) {
			seen[j] = 1;
			x[j] = 0;
		}
	}
	cout << s - os << '\n';
}
# Verdict Execution time Memory Grader output
1 Execution timed out 2011 ms 22868 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 3 ms 10840 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 9 ms 10844 KB Output is correct
7 Correct 12 ms 10840 KB Output is correct
8 Correct 10 ms 10844 KB Output is correct
9 Correct 8 ms 10844 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10840 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 10 ms 10844 KB Output is correct
14 Correct 12 ms 10840 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 12 ms 10988 KB Output is correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 4 ms 10844 KB Output is correct
19 Correct 9 ms 10844 KB Output is correct
20 Correct 9 ms 10844 KB Output is correct
21 Correct 7 ms 10988 KB Output is correct
22 Correct 12 ms 10844 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 2 ms 10840 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 8 ms 10856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 3 ms 10840 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 9 ms 10844 KB Output is correct
7 Correct 12 ms 10840 KB Output is correct
8 Correct 10 ms 10844 KB Output is correct
9 Correct 8 ms 10844 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10840 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 10 ms 10844 KB Output is correct
14 Correct 12 ms 10840 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 12 ms 10988 KB Output is correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 4 ms 10844 KB Output is correct
19 Correct 9 ms 10844 KB Output is correct
20 Correct 9 ms 10844 KB Output is correct
21 Correct 7 ms 10988 KB Output is correct
22 Correct 12 ms 10844 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 2 ms 10840 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 8 ms 10856 KB Output is correct
29 Execution timed out 2063 ms 24048 KB Time limit exceeded
30 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 3 ms 10840 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 9 ms 10844 KB Output is correct
7 Correct 12 ms 10840 KB Output is correct
8 Correct 10 ms 10844 KB Output is correct
9 Correct 8 ms 10844 KB Output is correct
10 Correct 3 ms 10844 KB Output is correct
11 Correct 2 ms 10840 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct
13 Correct 10 ms 10844 KB Output is correct
14 Correct 12 ms 10840 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 12 ms 10988 KB Output is correct
17 Correct 2 ms 10844 KB Output is correct
18 Correct 4 ms 10844 KB Output is correct
19 Correct 9 ms 10844 KB Output is correct
20 Correct 9 ms 10844 KB Output is correct
21 Correct 7 ms 10988 KB Output is correct
22 Correct 12 ms 10844 KB Output is correct
23 Correct 2 ms 10844 KB Output is correct
24 Correct 2 ms 10840 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 4 ms 10844 KB Output is correct
27 Correct 3 ms 10840 KB Output is correct
28 Correct 8 ms 10856 KB Output is correct
29 Correct 2 ms 10840 KB Output is correct
30 Correct 14 ms 10844 KB Output is correct
31 Correct 11 ms 10988 KB Output is correct
32 Correct 3 ms 10844 KB Output is correct
33 Incorrect 12 ms 10984 KB Output isn't correct
34 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2011 ms 22868 KB Time limit exceeded
2 Halted 0 ms 0 KB -