#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
const ll maxn=2e5+2;
int n, b[maxn];
ii a[maxn];
int ans[maxn];
int x[maxn],y[maxn];
int main(){
cin>>n;
for (int i=0;i<=n;++i){
cin>>a[i].fi;
a[i].se=i;
}
for (int i=0;i<n;++i){
cin>>b[i];
}
sort(a,a+n+1);
sort(b,b+n);
x[0]=max(a[0].fi-b[0],0);
for (int i=1;i<n;++i){
x[i]=max(x[i-1],max(a[i].fi-b[i],0));
}
y[n]=max(a[n].fi-b[n-1],0);
for (int i=n-1;i>0;--i){
y[i]=max(y[i+1],max(a[i].fi-b[i-1],0));
}
/*for (int i=0;i<n;++i){
cout<<x[i]<<" ";
}
cout<<endl;*/
ans[a[0].se]=y[1];
ans[a[n].se]=x[n-1];
for (int i=1;i<n;++i){
ans[a[i].se]=max(x[i-1],y[i+1]);
}
for (int i=0;i<=n;++i){
cout<<ans[i]<<" ";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
2 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
2 ms |
340 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
2 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
2 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
1 ms |
340 KB |
Output is correct |
31 |
Correct |
2 ms |
340 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
33 |
Correct |
142 ms |
6280 KB |
Output is correct |
34 |
Correct |
157 ms |
6480 KB |
Output is correct |
35 |
Correct |
145 ms |
6272 KB |
Output is correct |
36 |
Correct |
175 ms |
6656 KB |
Output is correct |
37 |
Correct |
155 ms |
6876 KB |
Output is correct |
38 |
Correct |
153 ms |
6852 KB |
Output is correct |
39 |
Correct |
145 ms |
5900 KB |
Output is correct |
40 |
Correct |
155 ms |
5896 KB |
Output is correct |
41 |
Correct |
145 ms |
5964 KB |
Output is correct |
42 |
Correct |
150 ms |
5964 KB |
Output is correct |
43 |
Correct |
156 ms |
5968 KB |
Output is correct |
44 |
Correct |
147 ms |
5668 KB |
Output is correct |
45 |
Correct |
171 ms |
5632 KB |
Output is correct |
46 |
Correct |
146 ms |
5580 KB |
Output is correct |
47 |
Correct |
144 ms |
5508 KB |
Output is correct |
48 |
Correct |
159 ms |
5416 KB |
Output is correct |
49 |
Correct |
152 ms |
6120 KB |
Output is correct |
50 |
Correct |
155 ms |
6132 KB |
Output is correct |
51 |
Correct |
157 ms |
6124 KB |
Output is correct |
52 |
Correct |
149 ms |
6056 KB |
Output is correct |
53 |
Correct |
150 ms |
6104 KB |
Output is correct |