Submission #593333

# Submission time Handle Problem Language Result Execution time Memory
593333 2022-07-10T22:01:40 Z YesPy Gap (APIO16_gap) C++17
100 / 100
50 ms 1832 KB
#include "gap.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll MAXN = 1e18;

ll a[100000], j = 0;

ll findGap(int T, int N) {
	if (T == 1) {
		ll l = 1, r = MAXN;
		ll mn, mx;
		vector<ll> v;
		for (ll i = 0; i < (N + 1) / 2; i++) {
			MinMax(l, r, &mn, &mx);
			a[j++] = mn;
			a[j++] = mx;
			l = mn + 1, r = mx - 1;
		}
		sort(a, a + N);
		ll ans = 0;
		for (ll i = 0; i < N - 1; i++) ans = max(ans, a[i + 1] - a[i]);
		return ans;
	} else {
		ll mn, mx;
		MinMax(1, MAXN, &mn, &mx);
		ll step = (mx - mn + N - 2) / (N - 1);
		ll ans = step, x, y, l = mn, i;
		for (i = mn; i + step < mx; i += step + 1) {
			MinMax(i, i + step, &x, &y);
			if (x != -1) {
				ans = max(ans, x - l);
				l = y;
			}
		}
		MinMax(i, mx, &x, &y);
		if (x != -1) ans = max(ans, x - l);
		return ans;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 9 ms 636 KB Output is correct
17 Correct 9 ms 644 KB Output is correct
18 Correct 9 ms 592 KB Output is correct
19 Correct 9 ms 720 KB Output is correct
20 Correct 7 ms 592 KB Output is correct
21 Correct 42 ms 1780 KB Output is correct
22 Correct 38 ms 1740 KB Output is correct
23 Correct 37 ms 1832 KB Output is correct
24 Correct 38 ms 1828 KB Output is correct
25 Correct 34 ms 1824 KB Output is correct
26 Correct 38 ms 1796 KB Output is correct
27 Correct 37 ms 1776 KB Output is correct
28 Correct 38 ms 1816 KB Output is correct
29 Correct 37 ms 1832 KB Output is correct
30 Correct 35 ms 1800 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 11 ms 436 KB Output is correct
17 Correct 13 ms 432 KB Output is correct
18 Correct 11 ms 524 KB Output is correct
19 Correct 11 ms 464 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 50 ms 1064 KB Output is correct
22 Correct 47 ms 1072 KB Output is correct
23 Correct 49 ms 1084 KB Output is correct
24 Correct 49 ms 1076 KB Output is correct
25 Correct 44 ms 1088 KB Output is correct
26 Correct 48 ms 1064 KB Output is correct
27 Correct 47 ms 968 KB Output is correct
28 Correct 49 ms 1104 KB Output is correct
29 Correct 50 ms 1040 KB Output is correct
30 Correct 24 ms 1104 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct