#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
int main(){
int n; cin >> n;
pll a[n + 2];
for(int i = 1; i <= n + 1; i++){
cin >> a[i].f;
a[i].s = i;
}
sort(a + 1, a + 2 + n);
//reverse(a + 1, a + 2 + n);
ll b[n + 1];
for(int i = 1; i <= n; i++) cin >> b[i];
sort(b + 1, b + 1 + n);
//reverse(b + 1, b + 1 + n);
ll pref[n + 1];
ll suf[n + 3];
pref[0] = 0;
suf[n + 2] = 0;
for(int i = 1; i <= n; i++){
pref[i] = max(pref[i - 1], a[i].f - b[i]);
}
for(int i = n + 1; i >= 2; i--){
suf[i] = max(suf[i + 1], a[i].f - b[i - 1]);
}
int ans[n + 2];
for(int i = 1; i <= n + 1; i++){
ans[a[i].s] = max(pref[i - 1], suf[i + 1]);
}
for(int i = 1; i <= n + 1; i++) cout << ans[i] << ' ';
cout << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
2 ms |
312 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
312 KB |
Output is correct |
18 |
Correct |
2 ms |
348 KB |
Output is correct |
19 |
Correct |
2 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
3 ms |
308 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 |
3 ms |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 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 |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
2 ms |
312 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
312 KB |
Output is correct |
18 |
Correct |
2 ms |
348 KB |
Output is correct |
19 |
Correct |
2 ms |
340 KB |
Output is correct |
20 |
Correct |
2 ms |
340 KB |
Output is correct |
21 |
Correct |
3 ms |
308 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 |
3 ms |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
2 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 |
253 ms |
13600 KB |
Output is correct |
34 |
Correct |
203 ms |
14308 KB |
Output is correct |
35 |
Correct |
202 ms |
13752 KB |
Output is correct |
36 |
Correct |
196 ms |
14156 KB |
Output is correct |
37 |
Correct |
238 ms |
14624 KB |
Output is correct |
38 |
Correct |
201 ms |
14480 KB |
Output is correct |
39 |
Correct |
220 ms |
13520 KB |
Output is correct |
40 |
Correct |
195 ms |
13420 KB |
Output is correct |
41 |
Correct |
191 ms |
13572 KB |
Output is correct |
42 |
Correct |
196 ms |
13540 KB |
Output is correct |
43 |
Correct |
194 ms |
13400 KB |
Output is correct |
44 |
Correct |
200 ms |
12976 KB |
Output is correct |
45 |
Correct |
198 ms |
13132 KB |
Output is correct |
46 |
Correct |
216 ms |
12976 KB |
Output is correct |
47 |
Correct |
202 ms |
13272 KB |
Output is correct |
48 |
Correct |
198 ms |
13304 KB |
Output is correct |
49 |
Correct |
209 ms |
13824 KB |
Output is correct |
50 |
Correct |
221 ms |
13912 KB |
Output is correct |
51 |
Correct |
213 ms |
13932 KB |
Output is correct |
52 |
Correct |
208 ms |
13824 KB |
Output is correct |
53 |
Correct |
211 ms |
13892 KB |
Output is correct |