oj.uz

Submission #1062790

# Submission time Handle Problem Language Result Execution time Memory
1062790 2024-08-17T10:50:23 Z vuavisao Jobs (BOI24_jobs) C++17
40 / 100
 90 ms 32816 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

using ll = long long;

const int N = 300'000 + 10;
const ll INF = 1'000'000'000'000'000'000;

int n;
ll s;

vector<int> g[N];
ll cost[N];
int parent[N];

namespace sub1 {
	bool check() {
		return (s == INF);
	}

	ll dp[N];

	void dfs(int u) {
		dp[u] = cost[u];
		for (const auto& v : g[u]) {
			dfs(v);
			dp[u] += dp[v];
		}
		dp[u] = max(dp[u], 0ll);
	}


	void solve() {
		dfs(0);
		// for (int u = 1; u <= n; ++ u) cout << dp[u] << " \n"[u == n];
		cout << dp[0];
	}
}

namespace sub23 {
	bool check() {
		for (int u = 1; u <= n; ++ u) {
			if (parent[u] != 0 && parent[u] != u - 1) return false;
		}
		return true;
	}
	
	ll sum[N], mi[N];

	void solve() {
		ll first = s;
		vector<pair<ll, ll>> candidates;
		mi[0] = INF;
		for (int u = 1; u <= n; ++ u) {
			int p = parent[u];
			ll add = sum[p] + cost[u];
			mi[u] = min(mi[p], add);
			if (add > 0) {
				candidates.push_back(make_pair(-mi[u], add));
				sum[u] = 0;
			}
			else {
				sum[u] = add;
			}
		}
		sort(candidates.begin(), candidates.end());
		for (const auto& [need, add] : candidates) {
			if (s - need < 0) {
				break;
			}
			s += add;
		}
		cout << s - first;
	}
}

namespace sub4 {
	bool check() {
		return (n <= 2'000);
	}

	ll mi[N], sum[N];

	void dfsRem(int u) {
		for (const auto& v : g[u]) {
			ll add = sum[u] + cost[v];
			mi[v] = min(mi[u], add);
			sum[v] = add;
			dfsRem(v);
		}
	}

	void solve() {
		ll first = s;
		ll res = s;
		for (int cnt = 1; cnt <= 2'000; ++ cnt) {
			for (int u = 0; u <= n; ++ u) {
				mi[u] = INF;
				sum[u] = 0;
			}
			dfsRem(0);
			int best = -1;
			for (ll u = 1; u <= n; ++ u) {
				if (-mi[u] <= s) {
					if (best == -1 || sum[u] > sum[best]) best = u;
				}
			}
			if (best == -1) {
				break;
			}
			s += sum[best];
			while (best != 0) {
				cost[best] = 0;
				best = parent[best];
			}
			res = max(res, s);
		}
		cout << res - first;
	}
}

int32_t main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr); std::cout.tie(nullptr);
	cin >> n >> s;
	for (int u = 1; u <= n; ++ u) {
		cin >> cost[u] >> parent[u];
		g[parent[u]].push_back(u);
	}
	if (sub1::check()) {
		sub1::solve();
		return 0;
	}
	if (sub23::check()) {
		sub23::solve();
		return 0;
	}
	if (sub4::check()) {
		sub4::solve();
		return 0;
	}
	assert(false);
	return (0 ^ 0);
}

/// Code by vuavisao

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 24656 KB Output is correct
2 Correct 66 ms 23356 KB Output is correct
3 Correct 61 ms 22860 KB Output is correct
4 Correct 58 ms 26876 KB Output is correct
5 Correct 56 ms 27988 KB Output is correct
6 Correct 46 ms 19184 KB Output is correct
7 Correct 81 ms 23380 KB Output is correct
8 Correct 72 ms 23628 KB Output is correct
9 Correct 50 ms 25956 KB Output is correct
10 Correct 55 ms 27476 KB Output is correct
11 Correct 90 ms 25388 KB Output is correct
12 Correct 59 ms 21844 KB Output is correct
13 Correct 84 ms 24400 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8024 KB Output is correct
2 Correct 3 ms 8160 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 3 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 4 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 3 ms 8284 KB Output is correct
14 Correct 3 ms 8256 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 3 ms 8324 KB Output is correct
23 Correct 2 ms 8280 KB Output is correct
24 Correct 3 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8024 KB Output is correct
2 Correct 3 ms 8160 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 3 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 4 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 3 ms 8284 KB Output is correct
14 Correct 3 ms 8256 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 3 ms 8324 KB Output is correct
23 Correct 2 ms 8280 KB Output is correct
24 Correct 3 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct
29 Correct 59 ms 31940 KB Output is correct
30 Correct 60 ms 30924 KB Output is correct
31 Correct 54 ms 27420 KB Output is correct
32 Correct 50 ms 30056 KB Output is correct
33 Correct 60 ms 31964 KB Output is correct
34 Correct 61 ms 29520 KB Output is correct
35 Correct 37 ms 19972 KB Output is correct
36 Correct 63 ms 29036 KB Output is correct
37 Correct 69 ms 32596 KB Output is correct
38 Correct 66 ms 30404 KB Output is correct
39 Correct 58 ms 30340 KB Output is correct
40 Correct 60 ms 32672 KB Output is correct
41 Correct 58 ms 30604 KB Output is correct
42 Correct 34 ms 19160 KB Output is correct
43 Correct 56 ms 29772 KB Output is correct
44 Correct 58 ms 32460 KB Output is correct
45 Correct 63 ms 30412 KB Output is correct
46 Correct 56 ms 29892 KB Output is correct
47 Correct 66 ms 30668 KB Output is correct
48 Correct 75 ms 30020 KB Output is correct
49 Correct 66 ms 32556 KB Output is correct
50 Correct 59 ms 32704 KB Output is correct
51 Correct 42 ms 23244 KB Output is correct
52 Correct 56 ms 32200 KB Output is correct
53 Correct 38 ms 23108 KB Output is correct
54 Correct 76 ms 29124 KB Output is correct
55 Correct 63 ms 32456 KB Output is correct
56 Correct 58 ms 32632 KB Output is correct
57 Correct 59 ms 32216 KB Output is correct
58 Correct 58 ms 32276 KB Output is correct
59 Correct 57 ms 30408 KB Output is correct
60 Correct 61 ms 29260 KB Output is correct
61 Correct 56 ms 29820 KB Output is correct
62 Correct 66 ms 32816 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8024 KB Output is correct
2 Correct 3 ms 8160 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 3 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 4 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 3 ms 8284 KB Output is correct
14 Correct 3 ms 8256 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 5 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 3 ms 8324 KB Output is correct
23 Correct 2 ms 8280 KB Output is correct
24 Correct 3 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct
29 Correct 2 ms 8028 KB Output is correct
30 Correct 33 ms 8280 KB Output is correct
31 Correct 27 ms 8284 KB Output is correct
32 Correct 24 ms 8272 KB Output is correct
33 Incorrect 24 ms 8284 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 24656 KB Output is correct
2 Correct 66 ms 23356 KB Output is correct
3 Correct 61 ms 22860 KB Output is correct
4 Correct 58 ms 26876 KB Output is correct
5 Correct 56 ms 27988 KB Output is correct
6 Correct 46 ms 19184 KB Output is correct
7 Correct 81 ms 23380 KB Output is correct
8 Correct 72 ms 23628 KB Output is correct
9 Correct 50 ms 25956 KB Output is correct
10 Correct 55 ms 27476 KB Output is correct
11 Correct 90 ms 25388 KB Output is correct
12 Correct 59 ms 21844 KB Output is correct
13 Correct 84 ms 24400 KB Output is correct
14 Correct 3 ms 8024 KB Output is correct
15 Correct 3 ms 8160 KB Output is correct
16 Correct 3 ms 8028 KB Output is correct
17 Correct 2 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 3 ms 8284 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 2 ms 8284 KB Output is correct
23 Correct 2 ms 8284 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 3 ms 8284 KB Output is correct
27 Correct 3 ms 8256 KB Output is correct
28 Correct 4 ms 8284 KB Output is correct
29 Correct 3 ms 8284 KB Output is correct
30 Correct 3 ms 8284 KB Output is correct
31 Correct 3 ms 8284 KB Output is correct
32 Correct 3 ms 8284 KB Output is correct
33 Correct 5 ms 8284 KB Output is correct
34 Correct 3 ms 8284 KB Output is correct
35 Correct 3 ms 8324 KB Output is correct
36 Correct 2 ms 8280 KB Output is correct
37 Correct 3 ms 8284 KB Output is correct
38 Correct 3 ms 8284 KB Output is correct
39 Correct 3 ms 8540 KB Output is correct
40 Correct 3 ms 8284 KB Output is correct
41 Correct 2 ms 8284 KB Output is correct
42 Correct 59 ms 31940 KB Output is correct
43 Correct 60 ms 30924 KB Output is correct
44 Correct 54 ms 27420 KB Output is correct
45 Correct 50 ms 30056 KB Output is correct
46 Correct 60 ms 31964 KB Output is correct
47 Correct 61 ms 29520 KB Output is correct
48 Correct 37 ms 19972 KB Output is correct
49 Correct 63 ms 29036 KB Output is correct
50 Correct 69 ms 32596 KB Output is correct
51 Correct 66 ms 30404 KB Output is correct
52 Correct 58 ms 30340 KB Output is correct
53 Correct 60 ms 32672 KB Output is correct
54 Correct 58 ms 30604 KB Output is correct
55 Correct 34 ms 19160 KB Output is correct
56 Correct 56 ms 29772 KB Output is correct
57 Correct 58 ms 32460 KB Output is correct
58 Correct 63 ms 30412 KB Output is correct
59 Correct 56 ms 29892 KB Output is correct
60 Correct 66 ms 30668 KB Output is correct
61 Correct 75 ms 30020 KB Output is correct
62 Correct 66 ms 32556 KB Output is correct
63 Correct 59 ms 32704 KB Output is correct
64 Correct 42 ms 23244 KB Output is correct
65 Correct 56 ms 32200 KB Output is correct
66 Correct 38 ms 23108 KB Output is correct
67 Correct 76 ms 29124 KB Output is correct
68 Correct 63 ms 32456 KB Output is correct
69 Correct 58 ms 32632 KB Output is correct
70 Correct 59 ms 32216 KB Output is correct
71 Correct 58 ms 32276 KB Output is correct
72 Correct 57 ms 30408 KB Output is correct
73 Correct 61 ms 29260 KB Output is correct
74 Correct 56 ms 29820 KB Output is correct
75 Correct 66 ms 32816 KB Output is correct
76 Correct 2 ms 8028 KB Output is correct
77 Correct 33 ms 8280 KB Output is correct
78 Correct 27 ms 8284 KB Output is correct
79 Correct 24 ms 8272 KB Output is correct
80 Incorrect 24 ms 8284 KB Output isn't correct
81 Halted 0 ms 0 KB -