Submission #856735

# Submission time Handle Problem Language Result Execution time Memory
856735 2023-10-04T12:04:44 Z ttamx Gap (APIO16_gap) C++14
70 / 100
41 ms 3864 KB
#include "gap.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

long long findGap(int T, int n){
	ll mn,mx;
	MinMax(1,1e18,&mn,&mx);
	if(T==1){
		vector<ll> a(n);
		a[0]=mn,a[n-1]=mx;
		ll ans=0;
		for(int l=1,r=n-2;l<=r;l++,r--){
			MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);
			ans=max({ans,a[l]-a[l-1],a[r+1]-a[r]});
		}
		return ans;
	}
	ll ans=(mx-mn+n-2)/(n-1);
	for(ll l=mn,r=mx,p=mn;l+1<r;){
		MinMax(l+1,min(l+ans,r),&mn,&mx);
		l+=ans+1;
		if(mn!=-1)ans=max(ans,mn-p),p=mx;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2796 KB Output is correct
17 Correct 8 ms 2752 KB Output is correct
18 Correct 7 ms 2836 KB Output is correct
19 Correct 7 ms 2576 KB Output is correct
20 Correct 7 ms 2792 KB Output is correct
21 Correct 36 ms 3608 KB Output is correct
22 Correct 29 ms 3620 KB Output is correct
23 Correct 29 ms 3620 KB Output is correct
24 Correct 29 ms 3624 KB Output is correct
25 Correct 27 ms 3600 KB Output is correct
26 Correct 29 ms 3620 KB Output is correct
27 Correct 30 ms 3864 KB Output is correct
28 Correct 29 ms 3624 KB Output is correct
29 Correct 29 ms 3620 KB Output is correct
30 Correct 27 ms 3624 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2584 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2480 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 5 ms 2588 KB Output is correct
17 Correct 5 ms 2836 KB Output is correct
18 Correct 5 ms 2696 KB Output is correct
19 Correct 5 ms 2584 KB Output is correct
20 Correct 4 ms 2392 KB Output is correct
21 Correct 19 ms 2856 KB Output is correct
22 Correct 17 ms 2852 KB Output is correct
23 Correct 17 ms 3024 KB Output is correct
24 Correct 17 ms 2860 KB Output is correct
25 Correct 41 ms 2832 KB Output is correct
26 Correct 17 ms 2856 KB Output is correct
27 Correct 22 ms 2836 KB Output is correct
28 Correct 23 ms 2856 KB Output is correct
29 Correct 17 ms 2864 KB Output is correct
30 Correct 15 ms 2820 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct