#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int N;
cin >> N;
vector<pair<int, int>> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A[i].first;
A[i].second = i;
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
sort(begin(A), end(A));
sort(begin(B), end(B));
vector<int> pref(N + 1);
vector<int> suff(N + 1);
for (int i = 0; i < N; i++) {
pref[i] = max(A[i].first - B[i], 0);
suff[i] = max(A[i + 1].first - B[i], 0);
}
for (int i = 1; i < N; i++) {
pref[i] = max(pref[i], pref[i - 1]);
}
for (int i = N - 2; i >= 0; i--) {
suff[i] = max(suff[i], suff[i + 1]);
}
vector<int> ans(N + 1, 0);
for (int i = 0; i <= N; i++) {
ans[A[i].second] = max((i > 0 ? pref[i - 1] : 0), (i < N ? suff[i] : 0));
}
for (int i = 0; i <= N; i++) {
cout << ans[i] << " \n"[i == N];
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
13 |
Correct |
5 ms |
384 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
5 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
6 ms |
384 KB |
Output is correct |
18 |
Correct |
6 ms |
384 KB |
Output is correct |
19 |
Correct |
5 ms |
384 KB |
Output is correct |
20 |
Correct |
5 ms |
384 KB |
Output is correct |
21 |
Correct |
5 ms |
384 KB |
Output is correct |
22 |
Correct |
6 ms |
384 KB |
Output is correct |
23 |
Correct |
6 ms |
384 KB |
Output is correct |
24 |
Correct |
6 ms |
384 KB |
Output is correct |
25 |
Correct |
5 ms |
384 KB |
Output is correct |
26 |
Correct |
5 ms |
384 KB |
Output is correct |
27 |
Correct |
6 ms |
384 KB |
Output is correct |
28 |
Correct |
6 ms |
384 KB |
Output is correct |
29 |
Correct |
5 ms |
384 KB |
Output is correct |
30 |
Correct |
6 ms |
384 KB |
Output is correct |
31 |
Correct |
6 ms |
384 KB |
Output is correct |
32 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
13 |
Correct |
5 ms |
384 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
5 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
384 KB |
Output is correct |
17 |
Correct |
6 ms |
384 KB |
Output is correct |
18 |
Correct |
6 ms |
384 KB |
Output is correct |
19 |
Correct |
5 ms |
384 KB |
Output is correct |
20 |
Correct |
5 ms |
384 KB |
Output is correct |
21 |
Correct |
5 ms |
384 KB |
Output is correct |
22 |
Correct |
6 ms |
384 KB |
Output is correct |
23 |
Correct |
6 ms |
384 KB |
Output is correct |
24 |
Correct |
6 ms |
384 KB |
Output is correct |
25 |
Correct |
5 ms |
384 KB |
Output is correct |
26 |
Correct |
5 ms |
384 KB |
Output is correct |
27 |
Correct |
6 ms |
384 KB |
Output is correct |
28 |
Correct |
6 ms |
384 KB |
Output is correct |
29 |
Correct |
5 ms |
384 KB |
Output is correct |
30 |
Correct |
6 ms |
384 KB |
Output is correct |
31 |
Correct |
6 ms |
384 KB |
Output is correct |
32 |
Correct |
5 ms |
384 KB |
Output is correct |
33 |
Correct |
129 ms |
6392 KB |
Output is correct |
34 |
Correct |
128 ms |
6648 KB |
Output is correct |
35 |
Correct |
112 ms |
6392 KB |
Output is correct |
36 |
Correct |
118 ms |
6776 KB |
Output is correct |
37 |
Correct |
119 ms |
7032 KB |
Output is correct |
38 |
Correct |
120 ms |
7160 KB |
Output is correct |
39 |
Correct |
127 ms |
6008 KB |
Output is correct |
40 |
Correct |
114 ms |
6008 KB |
Output is correct |
41 |
Correct |
117 ms |
6156 KB |
Output is correct |
42 |
Correct |
112 ms |
6136 KB |
Output is correct |
43 |
Correct |
125 ms |
6008 KB |
Output is correct |
44 |
Correct |
113 ms |
5752 KB |
Output is correct |
45 |
Correct |
118 ms |
5752 KB |
Output is correct |
46 |
Correct |
113 ms |
5756 KB |
Output is correct |
47 |
Correct |
109 ms |
5624 KB |
Output is correct |
48 |
Correct |
113 ms |
5624 KB |
Output is correct |
49 |
Correct |
117 ms |
6264 KB |
Output is correct |
50 |
Correct |
118 ms |
6264 KB |
Output is correct |
51 |
Correct |
119 ms |
6268 KB |
Output is correct |
52 |
Correct |
122 ms |
6264 KB |
Output is correct |
53 |
Correct |
120 ms |
6264 KB |
Output is correct |