Submission #956133

# Submission time Handle Problem Language Result Execution time Memory
956133 2024-04-01T07:00:39 Z thinknoexit Gap (APIO16_gap) C++17
30 / 100
32 ms 2208 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;
		MinMax(now + 1, now + ans, &n1, &n2);
		if (n2 != -1) {
			now = n2;
			continue;
		}
		ll l = ans + 1, r = mx - now;
		ll pnow = now + ans;
		while (1) {
			ll mid = (l + r) / 2;
			ll nl, nr;
			MinMax(pnow + 1, now + mid, &nl, &nr);
			if (nl == -1) l = mid + 1, pnow = now + mid;
			else {
				ans = nl - now;
				now = nr;
				break;
			}
		}
		//cout << ans << ' ';
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 596 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 9 ms 904 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 7 ms 652 KB Output is correct
19 Correct 7 ms 648 KB Output is correct
20 Correct 6 ms 608 KB Output is correct
21 Correct 29 ms 1984 KB Output is correct
22 Correct 32 ms 1820 KB Output is correct
23 Correct 29 ms 1980 KB Output is correct
24 Correct 29 ms 1980 KB Output is correct
25 Correct 28 ms 1980 KB Output is correct
26 Correct 30 ms 1980 KB Output is correct
27 Correct 29 ms 1980 KB Output is correct
28 Correct 32 ms 2208 KB Output is correct
29 Correct 29 ms 1972 KB Output is correct
30 Correct 26 ms 1952 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 Partially correct 1 ms 344 KB Partially correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Output isn't correct
7 Incorrect 1 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Correct 1 ms 344 KB Output is correct
14 Incorrect 1 ms 344 KB Output isn't correct
15 Correct 1 ms 344 KB Output is correct
16 Incorrect 4 ms 816 KB Output isn't correct
17 Incorrect 4 ms 640 KB Output isn't correct
18 Incorrect 4 ms 644 KB Output isn't correct
19 Incorrect 4 ms 644 KB Output isn't correct
20 Correct 5 ms 620 KB Output is correct
21 Incorrect 15 ms 1220 KB Output isn't correct
22 Incorrect 14 ms 1096 KB Output isn't correct
23 Incorrect 13 ms 1216 KB Output isn't correct
24 Incorrect 14 ms 1232 KB Output isn't correct
25 Correct 25 ms 1236 KB Output is correct
26 Incorrect 18 ms 1232 KB Output isn't correct
27 Incorrect 15 ms 1216 KB Output isn't correct
28 Incorrect 14 ms 1164 KB Output isn't correct
29 Incorrect 14 ms 1212 KB Output isn't correct
30 Correct 18 ms 1220 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct