oj.uz

답안 #40799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40799 2018-02-08T07:40:14 Z ssnsarang2023 Gap (APIO16_gap) C++14
30 / 100
 79 ms 2212 KB 
#include <bits/stdc++.h>
#include "gap.h"
 
using namespace std;
 
typedef long long ll;
 
//#define DEBUG
 
#ifdef DEBUG
 
int n = 5;
ll a[5] = {2, 3, 6, 8, 12};
 
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 = (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) {
				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;
		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

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 404 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 1 ms 524 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 532 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 1 ms 552 KB Output is correct
11 Correct 2 ms 552 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 668 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 2 ms 668 KB Output is correct
16 Correct 16 ms 1024 KB Output is correct
17 Correct 14 ms 1024 KB Output is correct
18 Correct 14 ms 1024 KB Output is correct
19 Correct 14 ms 1024 KB Output is correct
20 Correct 10 ms 1024 KB Output is correct
21 Correct 53 ms 2140 KB Output is correct
22 Correct 53 ms 2140 KB Output is correct
23 Correct 53 ms 2140 KB Output is correct
24 Correct 71 ms 2140 KB Output is correct
25 Correct 45 ms 2212 KB Output is correct
26 Correct 53 ms 2212 KB Output is correct
27 Correct 53 ms 2212 KB Output is correct
28 Correct 53 ms 2212 KB Output is correct
29 Correct 53 ms 2212 KB Output is correct
30 Correct 41 ms 2212 KB Output is correct
31 Correct 1 ms 2212 KB Output is correct
32 Correct 1 ms 2212 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2212 KB Output is correct
2 Correct 1 ms 2212 KB Output is correct
3 Correct 1 ms 2212 KB Output is correct
4 Correct 2 ms 2212 KB Output is correct
5 Correct 2 ms 2212 KB Output is correct
6 Correct 2 ms 2212 KB Output is correct
7 Correct 2 ms 2212 KB Output is correct
8 Correct 2 ms 2212 KB Output is correct
9 Correct 2 ms 2212 KB Output is correct
10 Incorrect 1 ms 2212 KB Output isn't correct
11 Correct 3 ms 2212 KB Output is correct
12 Correct 3 ms 2212 KB Output is correct
13 Correct 2 ms 2212 KB Output is correct
14 Correct 3 ms 2212 KB Output is correct
15 Correct 2 ms 2212 KB Output is correct
16 Correct 19 ms 2212 KB Output is correct
17 Correct 20 ms 2212 KB Output is correct
18 Correct 19 ms 2212 KB Output is correct
19 Correct 19 ms 2212 KB Output is correct
20 Correct 12 ms 2212 KB Output is correct
21 Correct 75 ms 2212 KB Output is correct
22 Correct 76 ms 2212 KB Output is correct
23 Correct 75 ms 2212 KB Output is correct
24 Correct 76 ms 2212 KB Output is correct
25 Correct 76 ms 2212 KB Output is correct
26 Correct 79 ms 2212 KB Output is correct
27 Correct 72 ms 2212 KB Output is correct
28 Correct 78 ms 2212 KB Output is correct
29 Correct 76 ms 2212 KB Output is correct
30 Correct 45 ms 2212 KB Output is correct
31 Correct 1 ms 2212 KB Output is correct
32 Correct 1 ms 2212 KB Output is correct