oj.uz

Submission #763254

# Submission time Handle Problem Language Result Execution time Memory
763254 2023-06-22T07:14:51 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 78 ms 15436 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define foru(i,a,b) for(ll i = a; i <= b; ++i)
#define ford(i,a,b) for(ll i = a; i >= b; --i)
#define vt vector
#define fi first
#define se second
const int N = 200005;
int n;
pair<ll,int>a[N];
ll b[N];
ll ans[N];
ll res1[N];
ll res2[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	cin >> n;
	foru(i,0,n){
		cin >> a[i].fi;
		a[i].se = i;
	}
	foru(i,0,n-1){
		cin >> b[i];
	}
	sort(a,a+n+1);
	sort(b,b+n);
	foru(i,0,n-1){
		if(i == 0){
			res1[i] = max(a[i].fi-b[i],0LL);
		} else {
			res1[i] = max(res1[i-1],max(a[i].fi-b[i],0LL));
		}
	}
	ford(i,n,1){
		if(i == n){
			res2[i] = max(a[i].fi-b[i-1],0LL);
		} else {
			res2[i] = max(res2[i+1],max(a[i].fi-b[i-1],0LL));
		}
	}
	foru(i,0,n){
		int ptr = a[i].se;
		if(i == 0){
			ans[ptr] = res2[1];
		} else if(i == n){
			ans[ptr] = res1[n-1];
		} else {
			ans[ptr] = max(res1[i-1],res2[i+1]);
		}
	}
	foru(i,0,n){
		cout << ans[i] << " ";
	}
    return 0;
}////////////////

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 380 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 380 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 68 ms 14412 KB Output is correct
34 Correct 71 ms 15052 KB Output is correct
35 Correct 69 ms 14492 KB Output is correct
36 Correct 73 ms 15032 KB Output is correct
37 Correct 72 ms 15436 KB Output is correct
38 Correct 71 ms 15268 KB Output is correct
39 Correct 73 ms 14300 KB Output is correct
40 Correct 71 ms 14212 KB Output is correct
41 Correct 70 ms 14412 KB Output is correct
42 Correct 69 ms 14416 KB Output is correct
43 Correct 69 ms 14232 KB Output is correct
44 Correct 68 ms 13840 KB Output is correct
45 Correct 70 ms 14132 KB Output is correct
46 Correct 67 ms 13772 KB Output is correct
47 Correct 64 ms 14160 KB Output is correct
48 Correct 65 ms 14160 KB Output is correct
49 Correct 72 ms 14736 KB Output is correct
50 Correct 78 ms 14740 KB Output is correct
51 Correct 74 ms 14628 KB Output is correct
52 Correct 70 ms 14712 KB Output is correct
53 Correct 70 ms 14700 KB Output is correct