답안 #978198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978198	2024-05-09T02:44:48 Z	Amaarsaa	Gap (APIO16_gap)	C++14	30 / 100	44 ms	2268 KB

gap

#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll =long long;
ll Sub1(ll N) {
	ll b[N + 2],ans, lo1, hi1, lo, hi, l, r;
	l = 1;
	r = N;
	lo = 0;
	hi = LONG_MAX;
	while ( l <= r) {
		MinMax(lo, hi, &lo1, &hi1);
		if (lo1 == -1) break;
		b[l] = lo1;
		b[r] = hi1;
		lo = lo1 + 1;
		hi = hi1 - 1;
		l ++;
		r --;
	}
	ans = 0;
	for (int i = 2; i <= N; i ++) {
		ans =max(ans, b[i] - b[i - 1]);
	}
	return ans;
}
ll Sub2(ll N) {
	
	ll l, r, x, y, ans, n = N, s, i;
	MinMax(0, 1e18, &l, &r);
	s = (r - l +1 + n - 2)/(n - 1);
	ans = s;
	for ( i = l; i + s< r; i += (s + 1)) {
		MinMax(i, i + s, &x, &y);
		if ( x != -1) {
			ans =max(ans, x - l);
			l = y;
		}
	}
	MinMax(i, r, &x, &y);
	if ( x != -1) ans = max(ans, x- l);
	return ans;
}
long long findGap(int T, int N) {
	if ( T == 1) {
		return Sub1(N); 
	}
	else return Sub2(N);
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	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	1 ms	344 KB	Output is correct
7	Correct	1 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	644 KB	Output is correct
17	Correct	9 ms	640 KB	Output is correct
18	Correct	8 ms	636 KB	Output is correct
19	Correct	8 ms	892 KB	Output is correct
20	Correct	7 ms	616 KB	Output is correct
21	Correct	30 ms	2268 KB	Output is correct
22	Correct	30 ms	1984 KB	Output is correct
23	Correct	30 ms	1976 KB	Output is correct
24	Correct	30 ms	1976 KB	Output is correct
25	Correct	28 ms	1956 KB	Output is correct
26	Correct	30 ms	1976 KB	Output is correct
27	Correct	32 ms	2012 KB	Output is correct
28	Correct	30 ms	2020 KB	Output is correct
29	Correct	29 ms	1996 KB	Output is correct
30	Correct	26 ms	1988 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	Output isn't correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Incorrect	0 ms	344 KB	Output isn't correct
6	Correct	1 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	Incorrect	1 ms	344 KB	Output isn't correct
16	Correct	10 ms	812 KB	Output is correct
17	Correct	10 ms	636 KB	Output is correct
18	Correct	10 ms	648 KB	Output is correct
19	Correct	10 ms	640 KB	Output is correct
20	Correct	6 ms	768 KB	Output is correct
21	Correct	42 ms	1224 KB	Output is correct
22	Correct	42 ms	1224 KB	Output is correct
23	Correct	44 ms	1232 KB	Output is correct
24	Correct	41 ms	1204 KB	Output is correct
25	Incorrect	41 ms	1196 KB	Output isn't correct
26	Correct	42 ms	1212 KB	Output is correct
27	Correct	41 ms	1208 KB	Output is correct
28	Correct	41 ms	1208 KB	Output is correct
29	Correct	41 ms	1208 KB	Output is correct
30	Correct	24 ms	1220 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct