#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
int n, b[nx], l[nx], r[nx], mx, ans[nx];
vector<pair<int, int>> a(nx);
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
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];
b[n+1]=1e9;
sort(b+1, b+n+1);
sort(a.begin()+1, a.begin()+n+2);
for (int i=1; i<=n+1; i++) l[i]=max(l[i-1], a[i].first-b[i]);
for (int i=n; i>=1; i--) r[i]=max(r[i+1], a[i+1].first-b[i]);
for (int i=1; i<=n+1; i++) ans[a[i].second]=max(l[i], r[i]);
for (int i=1; i<=n+1; i++) cout<<ans[i]<<' ';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
Output is correct |
2 |
Correct |
1 ms |
1876 KB |
Output is correct |
3 |
Correct |
1 ms |
1876 KB |
Output is correct |
4 |
Correct |
1 ms |
1876 KB |
Output is correct |
5 |
Correct |
1 ms |
1876 KB |
Output is correct |
6 |
Correct |
1 ms |
1876 KB |
Output is correct |
7 |
Correct |
1 ms |
1876 KB |
Output is correct |
8 |
Correct |
1 ms |
1876 KB |
Output is correct |
9 |
Correct |
1 ms |
1876 KB |
Output is correct |
10 |
Correct |
1 ms |
1876 KB |
Output is correct |
11 |
Correct |
1 ms |
1876 KB |
Output is correct |
12 |
Correct |
1 ms |
1876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
Output is correct |
2 |
Correct |
1 ms |
1876 KB |
Output is correct |
3 |
Correct |
1 ms |
1876 KB |
Output is correct |
4 |
Correct |
1 ms |
1876 KB |
Output is correct |
5 |
Correct |
1 ms |
1876 KB |
Output is correct |
6 |
Correct |
1 ms |
1876 KB |
Output is correct |
7 |
Correct |
1 ms |
1876 KB |
Output is correct |
8 |
Correct |
1 ms |
1876 KB |
Output is correct |
9 |
Correct |
1 ms |
1876 KB |
Output is correct |
10 |
Correct |
1 ms |
1876 KB |
Output is correct |
11 |
Correct |
1 ms |
1876 KB |
Output is correct |
12 |
Correct |
1 ms |
1876 KB |
Output is correct |
13 |
Correct |
1 ms |
1876 KB |
Output is correct |
14 |
Correct |
2 ms |
2128 KB |
Output is correct |
15 |
Correct |
2 ms |
1876 KB |
Output is correct |
16 |
Correct |
1 ms |
1876 KB |
Output is correct |
17 |
Correct |
2 ms |
1928 KB |
Output is correct |
18 |
Correct |
2 ms |
1876 KB |
Output is correct |
19 |
Correct |
2 ms |
1876 KB |
Output is correct |
20 |
Correct |
2 ms |
1876 KB |
Output is correct |
21 |
Correct |
2 ms |
1876 KB |
Output is correct |
22 |
Correct |
2 ms |
1876 KB |
Output is correct |
23 |
Correct |
2 ms |
1876 KB |
Output is correct |
24 |
Correct |
2 ms |
1876 KB |
Output is correct |
25 |
Correct |
2 ms |
1876 KB |
Output is correct |
26 |
Correct |
2 ms |
1916 KB |
Output is correct |
27 |
Correct |
2 ms |
2004 KB |
Output is correct |
28 |
Correct |
2 ms |
1876 KB |
Output is correct |
29 |
Correct |
2 ms |
1876 KB |
Output is correct |
30 |
Correct |
2 ms |
1876 KB |
Output is correct |
31 |
Correct |
2 ms |
1876 KB |
Output is correct |
32 |
Correct |
2 ms |
1876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
Output is correct |
2 |
Correct |
1 ms |
1876 KB |
Output is correct |
3 |
Correct |
1 ms |
1876 KB |
Output is correct |
4 |
Correct |
1 ms |
1876 KB |
Output is correct |
5 |
Correct |
1 ms |
1876 KB |
Output is correct |
6 |
Correct |
1 ms |
1876 KB |
Output is correct |
7 |
Correct |
1 ms |
1876 KB |
Output is correct |
8 |
Correct |
1 ms |
1876 KB |
Output is correct |
9 |
Correct |
1 ms |
1876 KB |
Output is correct |
10 |
Correct |
1 ms |
1876 KB |
Output is correct |
11 |
Correct |
1 ms |
1876 KB |
Output is correct |
12 |
Correct |
1 ms |
1876 KB |
Output is correct |
13 |
Correct |
1 ms |
1876 KB |
Output is correct |
14 |
Correct |
2 ms |
2128 KB |
Output is correct |
15 |
Correct |
2 ms |
1876 KB |
Output is correct |
16 |
Correct |
1 ms |
1876 KB |
Output is correct |
17 |
Correct |
2 ms |
1928 KB |
Output is correct |
18 |
Correct |
2 ms |
1876 KB |
Output is correct |
19 |
Correct |
2 ms |
1876 KB |
Output is correct |
20 |
Correct |
2 ms |
1876 KB |
Output is correct |
21 |
Correct |
2 ms |
1876 KB |
Output is correct |
22 |
Correct |
2 ms |
1876 KB |
Output is correct |
23 |
Correct |
2 ms |
1876 KB |
Output is correct |
24 |
Correct |
2 ms |
1876 KB |
Output is correct |
25 |
Correct |
2 ms |
1876 KB |
Output is correct |
26 |
Correct |
2 ms |
1916 KB |
Output is correct |
27 |
Correct |
2 ms |
2004 KB |
Output is correct |
28 |
Correct |
2 ms |
1876 KB |
Output is correct |
29 |
Correct |
2 ms |
1876 KB |
Output is correct |
30 |
Correct |
2 ms |
1876 KB |
Output is correct |
31 |
Correct |
2 ms |
1876 KB |
Output is correct |
32 |
Correct |
2 ms |
1876 KB |
Output is correct |
33 |
Correct |
68 ms |
10060 KB |
Output is correct |
34 |
Correct |
73 ms |
10316 KB |
Output is correct |
35 |
Correct |
69 ms |
10060 KB |
Output is correct |
36 |
Correct |
77 ms |
10572 KB |
Output is correct |
37 |
Correct |
72 ms |
10828 KB |
Output is correct |
38 |
Correct |
72 ms |
10720 KB |
Output is correct |
39 |
Correct |
70 ms |
9740 KB |
Output is correct |
40 |
Correct |
69 ms |
9708 KB |
Output is correct |
41 |
Correct |
69 ms |
9804 KB |
Output is correct |
42 |
Correct |
74 ms |
9928 KB |
Output is correct |
43 |
Correct |
68 ms |
9804 KB |
Output is correct |
44 |
Correct |
69 ms |
9380 KB |
Output is correct |
45 |
Correct |
68 ms |
9496 KB |
Output is correct |
46 |
Correct |
67 ms |
9376 KB |
Output is correct |
47 |
Correct |
64 ms |
9388 KB |
Output is correct |
48 |
Correct |
65 ms |
9388 KB |
Output is correct |
49 |
Correct |
70 ms |
10060 KB |
Output is correct |
50 |
Correct |
71 ms |
10060 KB |
Output is correct |
51 |
Correct |
75 ms |
10060 KB |
Output is correct |
52 |
Correct |
72 ms |
9988 KB |
Output is correct |
53 |
Correct |
71 ms |
10060 KB |
Output is correct |