Submission #956508

# Submission time Handle Problem Language Result Execution time Memory
956508 2024-04-02T06:29:47 Z thinknoexit Gap (APIO16_gap) C++17
30.5523 / 100
58 ms 2228 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll a[100100];
int n;
ll ans = 1;
ll findGap(int T, int N) {
	n = N;
	if (T == 1) {
		a[0] = -1, a[n + 1] = inf + 1;
		for (int i = 1;i <= n / 2;i++) {
			MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
		}
		if (n & 1) {
			ll _;
			MinMax(a[n / 2] + 1, a[n / 2 + 2] - 1, &a[n / 2 + 1], &_);
		}
		for (int i = 1;i < n;i++) {
			ans = max(ans, a[i + 1] - a[i]);
		}
		return ans;
	}
	ll mn, mx;
	MinMax(0, inf, &mn, &mx);
	ll now = mn;
	while (now < mx) {
		ll n1, n2;
		ll t = ans;
		for (;;t *= 2) {
			MinMax(now + 1, now + t, &n1, &n2);
			if (n1 != -1) break;
		}
		ans = max(ans, n1 - now);
		now = n1;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 8 ms 612 KB Output is correct
17 Correct 9 ms 648 KB Output is correct
18 Correct 10 ms 600 KB Output is correct
19 Correct 7 ms 644 KB Output is correct
20 Correct 6 ms 704 KB Output is correct
21 Correct 32 ms 1944 KB Output is correct
22 Correct 30 ms 2216 KB Output is correct
23 Correct 33 ms 1944 KB Output is correct
24 Correct 31 ms 2228 KB Output is correct
25 Correct 27 ms 1952 KB Output is correct
26 Correct 32 ms 1924 KB Output is correct
27 Correct 31 ms 1988 KB Output is correct
28 Correct 31 ms 1988 KB Output is correct
29 Correct 30 ms 1964 KB Output is correct
30 Correct 25 ms 2080 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Partially correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 1 ms 344 KB Partially correct
5 Partially correct 1 ms 344 KB Partially correct
6 Partially correct 1 ms 344 KB Partially correct
7 Partially correct 1 ms 344 KB Partially correct
8 Partially correct 1 ms 344 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 10 ms 648 KB Partially correct
17 Partially correct 11 ms 820 KB Partially correct
18 Partially correct 12 ms 644 KB Partially correct
19 Partially correct 11 ms 652 KB Partially correct
20 Partially correct 8 ms 624 KB Partially correct
21 Partially correct 44 ms 1236 KB Partially correct
22 Partially correct 46 ms 1224 KB Partially correct
23 Partially correct 43 ms 1212 KB Partially correct
24 Partially correct 43 ms 1224 KB Partially correct
25 Partially correct 39 ms 1220 KB Partially correct
26 Partially correct 51 ms 1212 KB Partially correct
27 Partially correct 43 ms 1224 KB Partially correct
28 Partially correct 58 ms 1212 KB Partially correct
29 Partially correct 44 ms 1232 KB Partially correct
30 Partially correct 33 ms 1400 KB Partially correct
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct