oj.uz

답안 #40810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40810 2018-02-08T08:00:21 Z ssnsarang2023 Gap (APIO16_gap) C++14
100 / 100
 79 ms 2284 KB 
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

//#define DEBUG

#ifdef DEBUG

int n = 5;
ll arr[105] = {2, 3, 6, 8, 12};

void MinMax(ll x, ll y, ll *mn, ll *mx) {
	for (int i = 0; i < n; ++i) if (arr[i] >= x)
	{ (*mn) = arr[i]; break; }
	for (int i = n - 1; i >= 0; --i) if (arr[i] <= y)
	{ (*mx) = arr[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 = (mx - mn) / (n - 1ll) + (ll)((mx - mn) % (n - 1ll) != 0ll), pre = mn;
		ll pstep = mn, step = mn + d - 1, gap = 0;
		while (1) {
			ll mntmp = -1, mxtmp = -1;
			if (pstep < min(mx - 1ll, step)) MinMax(pstep + 1ll, min(mx - 1ll, step), &mntmp, &mxtmp);
			if (step >= mx - 1ll) {
				gap = max(gap, mntmp - pre);
				if (mxtmp != -1ll) gap = max(gap, mx - mxtmp);
				else gap = max(gap, mx - pre);
				break;
			} else if (mntmp != -1ll) gap = max(gap, mntmp - pre);
			pre = max(pre, mxtmp), pstep = step, step += d;
		}
		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; int pos = 0;
		for (int i = 0; i < _n - 1; ++i) {
			if (gap < a[i + 1] - a[i])
				gap = a[i + 1] - a[i], pos = i;
		}
		return gap;
	}
	return 0ll;
}

#ifdef DEBUG
int main() {
	freopen("input.txt", "rt", stdin);
	int t;
	scanf("%d%d", &t, &n);
	for (int i = 0; i < n; ++i) scanf("%lld", &arr[i]);
	printf("%lld", findGap(t, n));
	return 0;
}
#endif

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:53:19: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   ll gap = 0; int pos = 0;
                   ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 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 572 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 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 2 ms 688 KB Output is correct
16 Correct 16 ms 1004 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 14 ms 1004 KB Output is correct
19 Correct 14 ms 1004 KB Output is correct
20 Correct 10 ms 1004 KB Output is correct
21 Correct 52 ms 2156 KB Output is correct
22 Correct 55 ms 2156 KB Output is correct
23 Correct 54 ms 2156 KB Output is correct
24 Correct 60 ms 2156 KB Output is correct
25 Correct 44 ms 2156 KB Output is correct
26 Correct 55 ms 2176 KB Output is correct
27 Correct 52 ms 2176 KB Output is correct
28 Correct 55 ms 2176 KB Output is correct
29 Correct 56 ms 2284 KB Output is correct
30 Correct 40 ms 2284 KB Output is correct
31 Correct 1 ms 2284 KB Output is correct
32 Correct 1 ms 2284 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2284 KB Output is correct
2 Correct 1 ms 2284 KB Output is correct
3 Correct 1 ms 2284 KB Output is correct
4 Correct 1 ms 2284 KB Output is correct
5 Correct 1 ms 2284 KB Output is correct
6 Correct 2 ms 2284 KB Output is correct
7 Correct 1 ms 2284 KB Output is correct
8 Correct 1 ms 2284 KB Output is correct
9 Correct 1 ms 2284 KB Output is correct
10 Correct 1 ms 2284 KB Output is correct
11 Correct 2 ms 2284 KB Output is correct
12 Correct 3 ms 2284 KB Output is correct
13 Correct 3 ms 2284 KB Output is correct
14 Correct 2 ms 2284 KB Output is correct
15 Correct 2 ms 2284 KB Output is correct
16 Correct 18 ms 2284 KB Output is correct
17 Correct 19 ms 2284 KB Output is correct
18 Correct 18 ms 2284 KB Output is correct
19 Correct 19 ms 2284 KB Output is correct
20 Correct 9 ms 2284 KB Output is correct
21 Correct 73 ms 2284 KB Output is correct
22 Correct 73 ms 2284 KB Output is correct
23 Correct 74 ms 2284 KB Output is correct
24 Correct 70 ms 2284 KB Output is correct
25 Correct 73 ms 2284 KB Output is correct
26 Correct 79 ms 2284 KB Output is correct
27 Correct 70 ms 2284 KB Output is correct
28 Correct 70 ms 2284 KB Output is correct
29 Correct 78 ms 2284 KB Output is correct
30 Correct 38 ms 2284 KB Output is correct
31 Correct 1 ms 2284 KB Output is correct
32 Correct 1 ms 2284 KB Output is correct