Submission #982279

# Submission time Handle Problem Language Result Execution time Memory
982279 2024-05-14T05:39:13 Z CBCode Gap (APIO16_gap) C++17
89.1235 / 100
42 ms 3876 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll findGap(int T, int N) {
	if(T==1) {
		vector<ll> a(N);
		int l = 0, r = N-1;
		ll mnn = 0, mxx = 1e18;
		while(l <= r) {
			MinMax(mnn, mxx, &a[l], &a[r]);
			mnn = a[l]+1; mxx = a[r]-1;
			l++; r--;
		}
		ll ans = 0;
		for(int i = 1; i < N; i++) {
			ans = max(ans, a[i]-a[i-1]);
		}
		return ans;
	}
	else {
		ll mnn, mxx, premx;
		MinMax(0, 1e18, &mnn, &mxx);
		premx = mnn;
		const ll MX = mxx;
		ll minGap,ans; minGap = ans = (ll)ceil((long double)(mxx-mnn)/(N-1));
		ll s;
		//cout <<minGap<<endl;
		for(s = mnn+1; s < MX; s+=minGap) {
			MinMax(s, s+minGap, &mnn, &mxx);
			if(mnn == -1) continue;
			//cout << s << " " << mnn << " " << mxx << ' '<<premx<<endl;
			ans = max(ans, mnn-premx);
			premx = mxx;
			//cout << s+minGap << ' '<<mxx<<endl;
		}
		ans = max(ans, mxx-premx);
		return ans;
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 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 1 ms 2392 KB Output is correct
6 Correct 1 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 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 2 ms 2392 KB Output is correct
16 Correct 8 ms 2752 KB Output is correct
17 Correct 8 ms 2588 KB Output is correct
18 Correct 8 ms 2584 KB Output is correct
19 Correct 8 ms 2568 KB Output is correct
20 Correct 7 ms 2604 KB Output is correct
21 Correct 30 ms 3628 KB Output is correct
22 Correct 35 ms 3876 KB Output is correct
23 Correct 30 ms 3624 KB Output is correct
24 Correct 30 ms 3620 KB Output is correct
25 Correct 28 ms 3624 KB Output is correct
26 Correct 31 ms 3416 KB Output is correct
27 Correct 35 ms 3632 KB Output is correct
28 Correct 30 ms 3624 KB Output is correct
29 Correct 29 ms 3624 KB Output is correct
30 Correct 26 ms 3612 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2496 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2644 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 10 ms 2556 KB Output is correct
17 Correct 10 ms 2696 KB Output is correct
18 Correct 10 ms 2588 KB Output is correct
19 Correct 11 ms 2656 KB Output is correct
20 Partially correct 6 ms 2560 KB Partially correct
21 Correct 42 ms 2856 KB Output is correct
22 Correct 41 ms 2852 KB Output is correct
23 Correct 41 ms 2852 KB Output is correct
24 Correct 41 ms 2856 KB Output is correct
25 Correct 40 ms 2848 KB Output is correct
26 Correct 42 ms 2856 KB Output is correct
27 Correct 42 ms 2864 KB Output is correct
28 Correct 41 ms 2860 KB Output is correct
29 Correct 42 ms 2856 KB Output is correct
30 Partially correct 25 ms 2856 KB Partially correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct