#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, b[N], p[N], s[N], ans[N];
pair<int, int> a[N];
int main(){
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 + n + 2);
sort(b + 1, b + n + 1);
for(int i = 1 ; i <= n; i++){
p[i] = max(p[i-1], max(a[i].first - b[i], 0));
}
for(int i = n + 1; i > 1; i--){
s[i] = max(s[i + 1], max(a[i].first - b[i-1], 0));
}
for(int i =1 ; i <= n + 1; i++){
ans[a[i].second] = max(p[i-1], s[i + 1]);
}
for(int i =1; i <= n + 1; i++){
cout << ans[i] << " ";
}
cout << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 ms |
416 KB |
Output is correct |
| 6 |
Correct |
1 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 |
0 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 |
1 ms |
416 KB |
Output is correct |
| 6 |
Correct |
1 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 |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
3 ms |
512 KB |
Output is correct |
| 18 |
Correct |
3 ms |
384 KB |
Output is correct |
| 19 |
Correct |
3 ms |
384 KB |
Output is correct |
| 20 |
Correct |
3 ms |
384 KB |
Output is correct |
| 21 |
Correct |
3 ms |
512 KB |
Output is correct |
| 22 |
Correct |
3 ms |
384 KB |
Output is correct |
| 23 |
Correct |
3 ms |
384 KB |
Output is correct |
| 24 |
Correct |
3 ms |
384 KB |
Output is correct |
| 25 |
Correct |
3 ms |
512 KB |
Output is correct |
| 26 |
Correct |
3 ms |
512 KB |
Output is correct |
| 27 |
Correct |
3 ms |
512 KB |
Output is correct |
| 28 |
Correct |
3 ms |
512 KB |
Output is correct |
| 29 |
Correct |
2 ms |
384 KB |
Output is correct |
| 30 |
Correct |
3 ms |
384 KB |
Output is correct |
| 31 |
Correct |
3 ms |
384 KB |
Output is correct |
| 32 |
Correct |
3 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 ms |
416 KB |
Output is correct |
| 6 |
Correct |
1 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 |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
3 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
3 ms |
512 KB |
Output is correct |
| 18 |
Correct |
3 ms |
384 KB |
Output is correct |
| 19 |
Correct |
3 ms |
384 KB |
Output is correct |
| 20 |
Correct |
3 ms |
384 KB |
Output is correct |
| 21 |
Correct |
3 ms |
512 KB |
Output is correct |
| 22 |
Correct |
3 ms |
384 KB |
Output is correct |
| 23 |
Correct |
3 ms |
384 KB |
Output is correct |
| 24 |
Correct |
3 ms |
384 KB |
Output is correct |
| 25 |
Correct |
3 ms |
512 KB |
Output is correct |
| 26 |
Correct |
3 ms |
512 KB |
Output is correct |
| 27 |
Correct |
3 ms |
512 KB |
Output is correct |
| 28 |
Correct |
3 ms |
512 KB |
Output is correct |
| 29 |
Correct |
2 ms |
384 KB |
Output is correct |
| 30 |
Correct |
3 ms |
384 KB |
Output is correct |
| 31 |
Correct |
3 ms |
384 KB |
Output is correct |
| 32 |
Correct |
3 ms |
512 KB |
Output is correct |
| 33 |
Correct |
282 ms |
10036 KB |
Output is correct |
| 34 |
Correct |
297 ms |
10488 KB |
Output is correct |
| 35 |
Correct |
286 ms |
10104 KB |
Output is correct |
| 36 |
Correct |
291 ms |
10616 KB |
Output is correct |
| 37 |
Correct |
300 ms |
11028 KB |
Output is correct |
| 38 |
Correct |
307 ms |
10744 KB |
Output is correct |
| 39 |
Correct |
288 ms |
9844 KB |
Output is correct |
| 40 |
Correct |
290 ms |
9820 KB |
Output is correct |
| 41 |
Correct |
297 ms |
10068 KB |
Output is correct |
| 42 |
Correct |
299 ms |
9848 KB |
Output is correct |
| 43 |
Correct |
290 ms |
9720 KB |
Output is correct |
| 44 |
Correct |
289 ms |
9336 KB |
Output is correct |
| 45 |
Correct |
301 ms |
9592 KB |
Output is correct |
| 46 |
Correct |
303 ms |
9336 KB |
Output is correct |
| 47 |
Correct |
295 ms |
9592 KB |
Output is correct |
| 48 |
Correct |
292 ms |
9504 KB |
Output is correct |
| 49 |
Correct |
291 ms |
10104 KB |
Output is correct |
| 50 |
Correct |
302 ms |
10100 KB |
Output is correct |
| 51 |
Correct |
304 ms |
10084 KB |
Output is correct |
| 52 |
Correct |
300 ms |
10152 KB |
Output is correct |
| 53 |
Correct |
331 ms |
10104 KB |
Output is correct |
