/* be name khoda */
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define fori(i, n) forifrom(i, 0, n)
// ------------------------------------------------------------------
const ll maxn = 200010;
ll n, A[maxn], B[maxn], lt[maxn], rt[maxn], ids[maxn], pos[maxn];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
//ifstream cin("1.in");
cin >> n;
fori (i, n + 1) cin >> A[i];
fori (i, n) cin >> B[i];
iota(ids, ids + n + 1, 0);
sort(ids, ids + n + 1, [](ll a, ll b) { return A[a] < A[b]; } );
fori (i, n + 1) pos[ids[i]] = i;
sort(A, A + n + 1);
sort(B, B + n);
fori (i, n) {
lt[i + 1] = max(lt[i], A[i] - B[i]);
rt[n - i - 1] = max(rt[n - i], A[n - i] - B[n - i - 1]);
}
fori (i, n + 1) {
cout << max(lt[pos[i]], rt[pos[i]]) << ' ';
}
cout << '\n';
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 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 |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 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 |
1 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 |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
0 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
384 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 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 |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
1 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
384 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
2 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 |
1 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 |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct |
| 13 |
Correct |
0 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
384 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 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 |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
1 ms |
512 KB |
Output is correct |
| 29 |
Correct |
1 ms |
384 KB |
Output is correct |
| 30 |
Correct |
1 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
2 ms |
512 KB |
Output is correct |
| 33 |
Correct |
127 ms |
7980 KB |
Output is correct |
| 34 |
Correct |
135 ms |
8312 KB |
Output is correct |
| 35 |
Correct |
132 ms |
8056 KB |
Output is correct |
| 36 |
Correct |
134 ms |
8568 KB |
Output is correct |
| 37 |
Correct |
134 ms |
8696 KB |
Output is correct |
| 38 |
Correct |
136 ms |
8568 KB |
Output is correct |
| 39 |
Correct |
129 ms |
7800 KB |
Output is correct |
| 40 |
Correct |
128 ms |
7672 KB |
Output is correct |
| 41 |
Correct |
131 ms |
7800 KB |
Output is correct |
| 42 |
Correct |
129 ms |
7800 KB |
Output is correct |
| 43 |
Correct |
125 ms |
7800 KB |
Output is correct |
| 44 |
Correct |
132 ms |
7416 KB |
Output is correct |
| 45 |
Correct |
126 ms |
7416 KB |
Output is correct |
| 46 |
Correct |
128 ms |
7416 KB |
Output is correct |
| 47 |
Correct |
107 ms |
7288 KB |
Output is correct |
| 48 |
Correct |
99 ms |
7224 KB |
Output is correct |
| 49 |
Correct |
132 ms |
7928 KB |
Output is correct |
| 50 |
Correct |
130 ms |
7928 KB |
Output is correct |
| 51 |
Correct |
131 ms |
7928 KB |
Output is correct |
| 52 |
Correct |
133 ms |
8056 KB |
Output is correct |
| 53 |
Correct |
133 ms |
7932 KB |
Output is correct |
