Submission #982275

# Submission time Handle Problem Language Result Execution time Memory
982275 2024-05-14T05:34:25 Z CBCode Gap (APIO16_gap) C++17
30 / 100
47 ms 4100 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);
			//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 344 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 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 1 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 7 ms 2580 KB Output is correct
17 Correct 8 ms 2580 KB Output is correct
18 Correct 8 ms 2984 KB Output is correct
19 Correct 8 ms 2588 KB Output is correct
20 Correct 6 ms 2572 KB Output is correct
21 Correct 29 ms 3596 KB Output is correct
22 Correct 29 ms 3624 KB Output is correct
23 Correct 29 ms 3624 KB Output is correct
24 Correct 32 ms 3624 KB Output is correct
25 Correct 27 ms 3624 KB Output is correct
26 Correct 29 ms 3620 KB Output is correct
27 Correct 29 ms 3624 KB Output is correct
28 Correct 29 ms 3752 KB Output is correct
29 Correct 35 ms 3616 KB Output is correct
30 Correct 28 ms 4100 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 2392 KB Output is correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 0 ms 2392 KB Output isn't correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 0 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Correct 1 ms 2392 KB Output is correct
16 Incorrect 10 ms 2584 KB Output isn't correct
17 Incorrect 10 ms 2752 KB Output isn't correct
18 Incorrect 10 ms 2840 KB Output isn't correct
19 Incorrect 10 ms 2584 KB Output isn't correct
20 Incorrect 6 ms 2540 KB Output isn't correct
21 Incorrect 42 ms 2852 KB Output isn't correct
22 Incorrect 39 ms 2860 KB Output isn't correct
23 Incorrect 40 ms 2852 KB Output isn't correct
24 Incorrect 39 ms 2856 KB Output isn't correct
25 Correct 39 ms 2856 KB Output is correct
26 Incorrect 40 ms 2860 KB Output isn't correct
27 Incorrect 39 ms 2856 KB Output isn't correct
28 Incorrect 47 ms 2852 KB Output isn't correct
29 Incorrect 40 ms 2856 KB Output isn't correct
30 Incorrect 23 ms 2844 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 0 ms 2392 KB Output isn't correct