#include <bits/stdc++.h>
using namespace std;
const int k_N = 2e5 + 3;
int n;
pair<int, int> a[k_N];
int b[k_N];
int prefix[k_N], suffix[k_N];
int ans[k_N];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n + 1; ++i){
cin >> a[i].first;
a[i].second = i;
}
for(int i = 1; i <= n; ++i)
cin >> b[i];
sort(a + 1, a + 1 + n + 1);
sort(b + 1, b + 1 + n);
for(int i = 1; i <= n; ++i)
prefix[i] = max(prefix[i - 1], max(a[i].first - b[i], 0));
for(int i = n + 1; i >= 2; --i)
suffix[i] = max(suffix[i + 1], max(a[i].first - b[i - 1], 0));
for(int i = 1; i <= n + 1; ++i)
ans[a[i].second] = max(prefix[i - 1], suffix[i + 1]);
for(int i = 1; i <= n + 1; ++i)
cout << ans[i] << " ";
cout << "\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| 16 |
Correct |
0 ms |
384 KB |
Output is correct |
| 17 |
Correct |
1 ms |
512 KB |
Output is correct |
| 18 |
Correct |
1 ms |
512 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
1 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
1 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
512 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
1 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
0 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
512 KB |
Output is correct |
| 16 |
Correct |
0 ms |
384 KB |
Output is correct |
| 17 |
Correct |
1 ms |
512 KB |
Output is correct |
| 18 |
Correct |
1 ms |
512 KB |
Output is correct |
| 19 |
Correct |
1 ms |
512 KB |
Output is correct |
| 20 |
Correct |
1 ms |
512 KB |
Output is correct |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct |
| 23 |
Correct |
1 ms |
512 KB |
Output is correct |
| 24 |
Correct |
1 ms |
512 KB |
Output is correct |
| 25 |
Correct |
1 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
1 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
512 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
1 ms |
512 KB |
Output is correct |
| 32 |
Correct |
1 ms |
512 KB |
Output is correct |
| 33 |
Correct |
110 ms |
10104 KB |
Output is correct |
| 34 |
Correct |
109 ms |
10488 KB |
Output is correct |
| 35 |
Correct |
110 ms |
10104 KB |
Output is correct |
| 36 |
Correct |
108 ms |
10744 KB |
Output is correct |
| 37 |
Correct |
113 ms |
10872 KB |
Output is correct |
| 38 |
Correct |
112 ms |
10852 KB |
Output is correct |
| 39 |
Correct |
106 ms |
9848 KB |
Output is correct |
| 40 |
Correct |
104 ms |
9848 KB |
Output is correct |
| 41 |
Correct |
107 ms |
9848 KB |
Output is correct |
| 42 |
Correct |
106 ms |
9852 KB |
Output is correct |
| 43 |
Correct |
108 ms |
9856 KB |
Output is correct |
| 44 |
Correct |
104 ms |
9492 KB |
Output is correct |
| 45 |
Correct |
113 ms |
9464 KB |
Output is correct |
| 46 |
Correct |
111 ms |
9464 KB |
Output is correct |
| 47 |
Correct |
106 ms |
9464 KB |
Output is correct |
| 48 |
Correct |
109 ms |
9464 KB |
Output is correct |
| 49 |
Correct |
115 ms |
10104 KB |
Output is correct |
| 50 |
Correct |
110 ms |
10104 KB |
Output is correct |
| 51 |
Correct |
116 ms |
10104 KB |
Output is correct |
| 52 |
Correct |
115 ms |
10104 KB |
Output is correct |
| 53 |
Correct |
114 ms |
10104 KB |
Output is correct |
