Submission #1005856

# Submission time Handle Problem Language Result Execution time Memory
1005856 2024-06-23T07:11:44 Z omsincoconut Gap (APIO16_gap) C++17
30 / 100
37 ms 9036 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;
typedef long long ll;

ll findGap1(int N) {
	ll l = 1, r = N;
	ll fl = LLONG_MIN, fr = LLONG_MAX;
	ll arr[N+1];
	while (l <= r) {
		ll *q1 = new ll(0), *q2 = new ll(0);
		MinMax(fl, fr, q1, q2);
		arr[l++] = *q1;
		arr[r--] = *q2;
		fl = *q1+1;
		fr = *q2-1;
	}
	ll ans = 0;
	for (ll i = 1; i < N; i++) ans = max(ans, arr[i+1] - arr[i]);
	return ans;
}

void query(ll s, ll t, ll &q1, ll &q2) {
	ll *qr1 = new ll(0), *qr2 = new ll(0);
	MinMax(s, t, qr1, qr2);
	q1 = *qr1;
	q2 = *qr2;
}

ll findGap2(int N) {
	ll mi, mx;
	query(LLONG_MIN, LLONG_MAX, mi, mx);
	ll ans = (mx-mi+N-1)/N; // by pigeonhole

	ll lst = mi, lft = N;
	while (lst < mx && lft > 0) {
		ll q1, q2;
		query(lst+1, lst+ans, q1, q2);
		if (q1 == -1) {
			ll cq1, cq2;
			query(lst+1, mx-1, cq1, cq2);
			if (cq1 == -1) {
				ans = max(ans, mx-lst);
				lst = mx;
				lft = 0;
			} else {
				ans = max({ans, cq1-lst, mx-cq2});
				lst = cq1;
				mx = cq2;
				lft -= 2;
			}
		} else {
			lst = q2;
			lft--;
		}
		ans = max(ans, (mx-lst+lft-1)/lft);
	}
	return ans;
}

ll findGap(int T, int N) {
	return T == 1 ? findGap1(N) : findGap2(N);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 9 ms 3416 KB Output is correct
17 Correct 7 ms 3416 KB Output is correct
18 Correct 7 ms 3336 KB Output is correct
19 Correct 7 ms 3332 KB Output is correct
20 Correct 6 ms 3416 KB Output is correct
21 Correct 27 ms 6632 KB Output is correct
22 Correct 27 ms 6732 KB Output is correct
23 Correct 27 ms 6736 KB Output is correct
24 Correct 27 ms 6720 KB Output is correct
25 Correct 24 ms 6744 KB Output is correct
26 Correct 37 ms 6736 KB Output is correct
27 Correct 32 ms 6736 KB Output is correct
28 Correct 27 ms 6620 KB Output is correct
29 Correct 27 ms 6744 KB Output is correct
30 Correct 22 ms 6744 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 4696 KB Execution killed with signal 4
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 0 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 0 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 5 ms 2580 KB Partially correct
17 Partially correct 5 ms 2648 KB Partially correct
18 Partially correct 7 ms 2736 KB Partially correct
19 Partially correct 7 ms 2648 KB Partially correct
20 Partially correct 3 ms 2392 KB Partially correct
21 Partially correct 16 ms 3408 KB Partially correct
22 Partially correct 17 ms 3416 KB Partially correct
23 Partially correct 27 ms 3424 KB Partially correct
24 Partially correct 17 ms 3416 KB Partially correct
25 Partially correct 36 ms 9036 KB Partially correct
26 Partially correct 19 ms 3416 KB Partially correct
27 Partially correct 17 ms 3416 KB Partially correct
28 Partially correct 26 ms 3416 KB Partially correct
29 Partially correct 24 ms 3408 KB Partially correct
30 Partially correct 12 ms 2904 KB Partially correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct