Submission #40795

# Submission time Handle Problem Language Result Execution time Memory
40795 2018-02-08T07:30:28 Z ssnsarang2023 Gap (APIO16_gap) C++14
100 / 100
80 ms 2160 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

//#define DEBUG

#ifdef DEBUG

int n = 4;
ll a[4] = {2, 3, 6, 8};

void MinMax(ll x, ll y, ll *mn, ll *mx) {
	for (int i = 0; i < n; ++i) if (a[i] >= x)
	{ (*mn) = a[i]; break; }
	for (int i = n - 1; i >= 0; --i) if (a[i] <= y)
	{ (*mx) = a[i]; break; }
	if ((*mx) < (*mn)) (*mx) = (*mn) = -1;
}
#endif

ll findGap(int _t, int _n) {
	ll n = _n;
	ll mn = 1, mx = (ll)1e18;
	MinMax(mn, mx, &mn, &mx);
	if (_t == 2) {
		ll d = ceil((long double)(mx - mn) / (long double)(n - 1ll)), pre = mn, gap = 0;
		for (ll i = mn; i < mx; i += d) {
			ll mntmp = -1, mxtmp = -1;
			MinMax(i, i + d - 1, &mntmp, &mxtmp);
			if (mntmp == -1) continue;
			gap = max(gap, mntmp - pre);
			pre = mxtmp;
		}
		gap = max(gap, mx - pre);
		return gap;
	} else {
		vector<ll> a;
		a.resize(n);
		a[0] = mn, a[n - 1] = mx;
		int lo = 0, hi = n - 1;
		while (hi - lo > 1) {
			MinMax(a[lo] + 1ll, a[hi] - 1ll, &mn, &mx);
			++lo, --hi;
			a[lo] = mn, a[hi] = mx;
		}
		ll gap = 0;
		for (int i = 0; i < n - 1; ++i) gap = max(gap, a[i + 1] - a[i]);
		return gap;
	}
	return 0ll;
}

#ifdef DEBUG
int main() {
	printf("%d", findGap(1, 5));
	return 0;
}
#endif
# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 568 KB Output is correct
7 Correct 1 ms 584 KB Output is correct
8 Correct 1 ms 584 KB Output is correct
9 Correct 1 ms 584 KB Output is correct
10 Correct 1 ms 584 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 2 ms 584 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 15 ms 1004 KB Output is correct
17 Correct 15 ms 1004 KB Output is correct
18 Correct 16 ms 1004 KB Output is correct
19 Correct 14 ms 1004 KB Output is correct
20 Correct 11 ms 1004 KB Output is correct
21 Correct 58 ms 2156 KB Output is correct
22 Correct 55 ms 2156 KB Output is correct
23 Correct 55 ms 2156 KB Output is correct
24 Correct 58 ms 2160 KB Output is correct
25 Correct 47 ms 2160 KB Output is correct
26 Correct 55 ms 2160 KB Output is correct
27 Correct 56 ms 2160 KB Output is correct
28 Correct 58 ms 2160 KB Output is correct
29 Correct 58 ms 2160 KB Output is correct
30 Correct 43 ms 2160 KB Output is correct
31 Correct 1 ms 2160 KB Output is correct
32 Correct 1 ms 2160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2160 KB Output is correct
2 Correct 1 ms 2160 KB Output is correct
3 Correct 1 ms 2160 KB Output is correct
4 Correct 1 ms 2160 KB Output is correct
5 Correct 1 ms 2160 KB Output is correct
6 Correct 1 ms 2160 KB Output is correct
7 Correct 1 ms 2160 KB Output is correct
8 Correct 1 ms 2160 KB Output is correct
9 Correct 1 ms 2160 KB Output is correct
10 Correct 1 ms 2160 KB Output is correct
11 Correct 2 ms 2160 KB Output is correct
12 Correct 2 ms 2160 KB Output is correct
13 Correct 2 ms 2160 KB Output is correct
14 Correct 2 ms 2160 KB Output is correct
15 Correct 2 ms 2160 KB Output is correct
16 Correct 20 ms 2160 KB Output is correct
17 Correct 19 ms 2160 KB Output is correct
18 Correct 19 ms 2160 KB Output is correct
19 Correct 20 ms 2160 KB Output is correct
20 Correct 9 ms 2160 KB Output is correct
21 Correct 76 ms 2160 KB Output is correct
22 Correct 72 ms 2160 KB Output is correct
23 Correct 76 ms 2160 KB Output is correct
24 Correct 75 ms 2160 KB Output is correct
25 Correct 68 ms 2160 KB Output is correct
26 Correct 76 ms 2160 KB Output is correct
27 Correct 73 ms 2160 KB Output is correct
28 Correct 80 ms 2160 KB Output is correct
29 Correct 77 ms 2160 KB Output is correct
30 Correct 38 ms 2160 KB Output is correct
31 Correct 1 ms 2160 KB Output is correct
32 Correct 1 ms 2160 KB Output is correct