oj.uz

Submission #680573

# Submission time Handle Problem Language Result Execution time Memory
680573 2023-01-11T09:32:35 Z ethening Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 97 ms 10844 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<pii> a(n + 1);
	vector<int> b(n);
	for (int i = 0; i < n + 1; i++) {
		int tmp;
		cin >> tmp;
		a[i] = make_pair(tmp, i);
	}
	for (auto &o: b) {
		cin >> o;
	}
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	vector<int> pl(n + 1), pr(n + 1);
	for (int i = 0; i < n; i++) {
		if (i > 0) pl[i] = pl[i - 1];
		pl[i] = max(pl[i], max(a[i].first - b[i], 0));
		// cout << i << " " << pl[i] << endl;
	}
	for (int i = n - 1; i >= 0; i--) {
		if (i < n - 1) pr[i] = pr[i + 1];
		pr[i] = max(pr[i], max(a[i + 1].first - b[i], 0));
		// cout << i << ": " << pr[i] << endl;
	}
	vector<int> ans(n + 1);
	for (int i = 0; i <= n; i++) {
		if (i == 0) {
			ans[a[i].second] = pr[0];
		}
		else if (i == n) {
			ans[a[i].second] = pl[n - 1];
		}
		else {
			ans[a[i].second] = max(pl[i - 1], pr[i]);
		}
	}
	for (int i = 0; i <= n; i++) {
		cout << ans[i] << " \n"[i == n];
	}
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 228 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 228 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 372 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 388 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 336 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 228 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 372 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 388 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 87 ms 9976 KB Output is correct
34 Correct 96 ms 10316 KB Output is correct
35 Correct 83 ms 9992 KB Output is correct
36 Correct 86 ms 10464 KB Output is correct
37 Correct 94 ms 10844 KB Output is correct
38 Correct 89 ms 10704 KB Output is correct
39 Correct 97 ms 9860 KB Output is correct
40 Correct 82 ms 9748 KB Output is correct
41 Correct 97 ms 9784 KB Output is correct
42 Correct 83 ms 9772 KB Output is correct
43 Correct 85 ms 9708 KB Output is correct
44 Correct 91 ms 9256 KB Output is correct
45 Correct 82 ms 9360 KB Output is correct
46 Correct 91 ms 9364 KB Output is correct
47 Correct 77 ms 9444 KB Output is correct
48 Correct 78 ms 9452 KB Output is correct
49 Correct 93 ms 10056 KB Output is correct
50 Correct 88 ms 10120 KB Output is correct
51 Correct 88 ms 10180 KB Output is correct
52 Correct 88 ms 10060 KB Output is correct
53 Correct 84 ms 10076 KB Output is correct