답안 #956101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956101 2024-04-01T05:11:49 Z thinknoexit Gap (APIO16_gap) C++17
43.7968 / 100
84 ms 1996 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 = 0;
void play(ll l, ll r) {
	if (l >= r) return;
	ll mid = (l + r) / 2;
	ll ql, qr, _l, _r;
	MinMax(l, mid, &_l, &ql);
	MinMax(mid + 1, r, &qr, &_r);
	if (ql == -1 && qr == -1) return;
	if (ql == -1) return play(qr, r);
	if (qr == -1) return play(l, ql);
	if (ql != -1 && qr != -1) {
		mx = max(mx, qr - ql);
		play(_l, ql), 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;
	}
	play(0, 1e18);
	return mx;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 1 ms 344 KB Output is correct
9 Correct 1 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 816 KB Output is correct
17 Correct 8 ms 644 KB Output is correct
18 Correct 8 ms 640 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 6 ms 844 KB Output is correct
21 Correct 30 ms 1992 KB Output is correct
22 Correct 30 ms 1996 KB Output is correct
23 Correct 35 ms 1976 KB Output is correct
24 Correct 30 ms 1972 KB Output is correct
25 Correct 27 ms 1980 KB Output is correct
26 Correct 29 ms 1976 KB Output is correct
27 Correct 30 ms 1828 KB Output is correct
28 Correct 30 ms 1988 KB Output is correct
29 Correct 30 ms 1968 KB Output is correct
30 Correct 25 ms 1828 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 1 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 1 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 Partially correct 1 ms 344 KB Partially correct
11 Partially correct 2 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 2 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 18 ms 656 KB Partially correct
17 Partially correct 18 ms 644 KB Partially correct
18 Partially correct 17 ms 648 KB Partially correct
19 Partially correct 17 ms 904 KB Partially correct
20 Partially correct 16 ms 660 KB Partially correct
21 Partially correct 71 ms 1216 KB Partially correct
22 Partially correct 84 ms 1236 KB Partially correct
23 Partially correct 73 ms 1220 KB Partially correct
24 Partially correct 72 ms 1228 KB Partially correct
25 Partially correct 68 ms 1212 KB Partially correct
26 Partially correct 72 ms 1224 KB Partially correct
27 Partially correct 71 ms 1224 KB Partially correct
28 Partially correct 75 ms 1408 KB Partially correct
29 Partially correct 74 ms 1212 KB Partially correct
30 Partially correct 70 ms 1168 KB Partially correct
31 Partially correct 1 ms 344 KB Partially correct
32 Partially correct 1 ms 344 KB Partially correct