oj.uz

Submission #520911

# Submission time Handle Problem Language Result Execution time Memory
520911 2022-01-31T13:01:49 Z AdamGS Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 88 ms 15556 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
pair<ll,int>A[LIM];
ll B[LIM], pref[LIM], suf[LIM], ans[LIM];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	rep(i, n+1) {
		cin >> A[i].st;
		A[i].nd=i;
	}
	rep(i, n) cin >> B[i];
	sort(A, A+n+1);
	sort(B, B+n);
	rep(i, n) {
		if(i) pref[i]=pref[i-1];
		pref[i]=max(pref[i], max(A[i].st-B[i], 0ll));
	}
	for(int i=n-1; i>=0; --i) {
		suf[i]=suf[i+1];
		suf[i]=max(suf[i], max(A[i+1].st-B[i], 0ll));
	}
	ans[A[0].nd]=suf[0];
	ans[A[n].nd]=pref[n-1];
	for(int i=1; i<n; ++i) {
		ans[A[i].nd]=max(pref[i-1], suf[i]);
	}
	rep(i, n+1) cout << ans[i] << " ";
	cout << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 372 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 2 ms 456 KB Output is correct
33 Correct 78 ms 14468 KB Output is correct
34 Correct 82 ms 15004 KB Output is correct
35 Correct 79 ms 14520 KB Output is correct
36 Correct 82 ms 15044 KB Output is correct
37 Correct 83 ms 15556 KB Output is correct
38 Correct 84 ms 15324 KB Output is correct
39 Correct 83 ms 14296 KB Output is correct
40 Correct 80 ms 14268 KB Output is correct
41 Correct 80 ms 14404 KB Output is correct
42 Correct 80 ms 14296 KB Output is correct
43 Correct 80 ms 14252 KB Output is correct
44 Correct 84 ms 13780 KB Output is correct
45 Correct 78 ms 13952 KB Output is correct
46 Correct 78 ms 13764 KB Output is correct
47 Correct 79 ms 14148 KB Output is correct
48 Correct 81 ms 14148 KB Output is correct
49 Correct 84 ms 14640 KB Output is correct
50 Correct 82 ms 14712 KB Output is correct
51 Correct 82 ms 14788 KB Output is correct
52 Correct 83 ms 14648 KB Output is correct
53 Correct 88 ms 14772 KB Output is correct