oj.uz

Submission #763011

# Submission time Handle Problem Language Result Execution time Memory
763011 2023-06-22T02:24:33 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 87 ms 11656 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 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 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 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 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 348 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 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 1 ms 340 KB Output is correct
32 Correct 1 ms 340 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 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 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 348 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 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 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 79 ms 10676 KB Output is correct
34 Correct 83 ms 11228 KB Output is correct
35 Correct 79 ms 10832 KB Output is correct
36 Correct 79 ms 11228 KB Output is correct
37 Correct 81 ms 11656 KB Output is correct
38 Correct 79 ms 11464 KB Output is correct
39 Correct 81 ms 10512 KB Output is correct
40 Correct 74 ms 10540 KB Output is correct
41 Correct 82 ms 10632 KB Output is correct
42 Correct 87 ms 10568 KB Output is correct
43 Correct 78 ms 10496 KB Output is correct
44 Correct 74 ms 10048 KB Output is correct
45 Correct 75 ms 10208 KB Output is correct
46 Correct 75 ms 10136 KB Output is correct
47 Correct 74 ms 10248 KB Output is correct
48 Correct 75 ms 10220 KB Output is correct
49 Correct 77 ms 10780 KB Output is correct
50 Correct 81 ms 10764 KB Output is correct
51 Correct 81 ms 10764 KB Output is correct
52 Correct 82 ms 10840 KB Output is correct
53 Correct 86 ms 10760 KB Output is correct