#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5;
int n, arr[N + 5], b[N + 5], pos[N + 5], prefix[N + 5], suffix[N + 5], ans[N + 5];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 1; i <= n + 1; i++) cin >> arr[i];
for (int i = 1; i <= n; i++) cin >> b[i];
iota(pos + 1, pos + n + 2, 1);
sort(pos + 1, pos + n + 2, [&](int a, int b) { return arr[a] < arr[b]; });
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; i++) prefix[i] = max(prefix[i - 1], max(arr[pos[i]] - b[i], 0ll));
for (int i = n; i >= 1; i--) suffix[i] = max(suffix[i + 1], max(arr[pos[i + 1]] - b[i], 0ll));
ans[n + 1] = prefix[n];
for (int i = 1; i <= n + 1; i++) ans[pos[i]] = max(prefix[i - 1], suffix[i]);
for (int i = 1; i <= n + 1; i++) cout << ans[i] << " ";
cout << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
328 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
324 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
328 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
324 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
464 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
468 KB |
Output is correct |
18 |
Correct |
1 ms |
468 KB |
Output is correct |
19 |
Correct |
1 ms |
468 KB |
Output is correct |
20 |
Correct |
1 ms |
468 KB |
Output is correct |
21 |
Correct |
1 ms |
468 KB |
Output is correct |
22 |
Correct |
1 ms |
468 KB |
Output is correct |
23 |
Correct |
1 ms |
468 KB |
Output is correct |
24 |
Correct |
1 ms |
468 KB |
Output is correct |
25 |
Correct |
1 ms |
468 KB |
Output is correct |
26 |
Correct |
1 ms |
468 KB |
Output is correct |
27 |
Correct |
1 ms |
468 KB |
Output is correct |
28 |
Correct |
1 ms |
468 KB |
Output is correct |
29 |
Correct |
1 ms |
468 KB |
Output is correct |
30 |
Correct |
1 ms |
468 KB |
Output is correct |
31 |
Correct |
1 ms |
468 KB |
Output is correct |
32 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
328 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
324 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
464 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
468 KB |
Output is correct |
18 |
Correct |
1 ms |
468 KB |
Output is correct |
19 |
Correct |
1 ms |
468 KB |
Output is correct |
20 |
Correct |
1 ms |
468 KB |
Output is correct |
21 |
Correct |
1 ms |
468 KB |
Output is correct |
22 |
Correct |
1 ms |
468 KB |
Output is correct |
23 |
Correct |
1 ms |
468 KB |
Output is correct |
24 |
Correct |
1 ms |
468 KB |
Output is correct |
25 |
Correct |
1 ms |
468 KB |
Output is correct |
26 |
Correct |
1 ms |
468 KB |
Output is correct |
27 |
Correct |
1 ms |
468 KB |
Output is correct |
28 |
Correct |
1 ms |
468 KB |
Output is correct |
29 |
Correct |
1 ms |
468 KB |
Output is correct |
30 |
Correct |
1 ms |
468 KB |
Output is correct |
31 |
Correct |
1 ms |
468 KB |
Output is correct |
32 |
Correct |
1 ms |
468 KB |
Output is correct |
33 |
Correct |
82 ms |
14416 KB |
Output is correct |
34 |
Correct |
82 ms |
14988 KB |
Output is correct |
35 |
Correct |
73 ms |
14576 KB |
Output is correct |
36 |
Correct |
73 ms |
15016 KB |
Output is correct |
37 |
Correct |
77 ms |
15552 KB |
Output is correct |
38 |
Correct |
75 ms |
15292 KB |
Output is correct |
39 |
Correct |
73 ms |
14296 KB |
Output is correct |
40 |
Correct |
72 ms |
14260 KB |
Output is correct |
41 |
Correct |
73 ms |
14468 KB |
Output is correct |
42 |
Correct |
75 ms |
14388 KB |
Output is correct |
43 |
Correct |
73 ms |
14328 KB |
Output is correct |
44 |
Correct |
70 ms |
13736 KB |
Output is correct |
45 |
Correct |
72 ms |
13936 KB |
Output is correct |
46 |
Correct |
75 ms |
13848 KB |
Output is correct |
47 |
Correct |
57 ms |
14040 KB |
Output is correct |
48 |
Correct |
58 ms |
14160 KB |
Output is correct |
49 |
Correct |
75 ms |
14728 KB |
Output is correct |
50 |
Correct |
75 ms |
14636 KB |
Output is correct |
51 |
Correct |
77 ms |
14712 KB |
Output is correct |
52 |
Correct |
75 ms |
14700 KB |
Output is correct |
53 |
Correct |
75 ms |
14712 KB |
Output is correct |