Submission #956224

# Submission time Handle Problem Language Result Execution time Memory
956224 2024-04-01T10:59:43 Z thinknoexit Gap (APIO16_gap) C++17
30 / 100
33 ms 2096 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 mx = 1;
void play(ll l, ll r) {
	if (r - l <= mx) return;
	ll mid = (l + r) / 2;
	ll ql = -1, qr = -1, _l = -1, _r = -1;
	if (l + 1 <= mid) MinMax(l + 1, mid, &_l, &ql);
	if (mid + 1 <= r - 1) MinMax(mid + 1, r - 1, &qr, &_r);
	if (ql == -1) ql = l;
	if (qr == -1) qr = r;
	mx = max(mx, qr - ql);
	if (_l != -1) play(_l, ql);
	if (_r != -1) play(qr, _r);
}
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++) {
			mx = max(mx, a[i + 1] - a[i]);
		}
		return mx;
	}
	ll l, r;
	MinMax(0, inf, &l, &r);
	play(l, r);
	return mx;
}
# 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 0 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 7 ms 620 KB Output is correct
17 Correct 7 ms 648 KB Output is correct
18 Correct 7 ms 856 KB Output is correct
19 Correct 7 ms 652 KB Output is correct
20 Correct 6 ms 616 KB Output is correct
21 Correct 28 ms 1976 KB Output is correct
22 Correct 28 ms 1972 KB Output is correct
23 Correct 28 ms 2004 KB Output is correct
24 Correct 28 ms 2096 KB Output is correct
25 Correct 25 ms 1952 KB Output is correct
26 Correct 28 ms 2000 KB Output is correct
27 Correct 28 ms 2012 KB Output is correct
28 Correct 28 ms 1976 KB Output is correct
29 Correct 28 ms 1972 KB Output is correct
30 Correct 23 ms 1960 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 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 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Correct 0 ms 344 KB Output is 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 6 ms 648 KB Partially correct
17 Partially correct 6 ms 876 KB Partially correct
18 Partially correct 6 ms 648 KB Partially correct
19 Partially correct 6 ms 812 KB Partially correct
20 Correct 2 ms 620 KB Output is correct
21 Partially correct 21 ms 1028 KB Partially correct
22 Partially correct 20 ms 1216 KB Partially correct
23 Partially correct 20 ms 1220 KB Partially correct
24 Partially correct 21 ms 1472 KB Partially correct
25 Partially correct 33 ms 1196 KB Partially correct
26 Partially correct 24 ms 1228 KB Partially correct
27 Partially correct 21 ms 1212 KB Partially correct
28 Partially correct 21 ms 1220 KB Partially correct
29 Incorrect 22 ms 1244 KB Output isn't correct
30 Correct 7 ms 1172 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct