답안 #978197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978197	2024-05-09T02:42:56 Z	Amaarsaa	Gap (APIO16_gap)	C++14	100 / 100	43 ms	2464 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 + 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	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	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	8 ms	620 KB	Output is correct
17	Correct	8 ms	644 KB	Output is correct
18	Correct	10 ms	772 KB	Output is correct
19	Correct	8 ms	640 KB	Output is correct
20	Correct	6 ms	624 KB	Output is correct
21	Correct	30 ms	1960 KB	Output is correct
22	Correct	30 ms	1984 KB	Output is correct
23	Correct	33 ms	2464 KB	Output is correct
24	Correct	30 ms	2240 KB	Output is correct
25	Correct	27 ms	1980 KB	Output is correct
26	Correct	32 ms	1976 KB	Output is correct
27	Correct	30 ms	1996 KB	Output is correct
28	Correct	30 ms	1976 KB	Output is correct
29	Correct	29 ms	2180 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

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	596 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	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	472 KB	Output is correct
16	Correct	11 ms	636 KB	Output is correct
17	Correct	10 ms	636 KB	Output is correct
18	Correct	10 ms	808 KB	Output is correct
19	Correct	10 ms	632 KB	Output is correct
20	Correct	5 ms	616 KB	Output is correct
21	Correct	42 ms	1228 KB	Output is correct
22	Correct	42 ms	1208 KB	Output is correct
23	Correct	41 ms	1208 KB	Output is correct
24	Correct	41 ms	1216 KB	Output is correct
25	Correct	40 ms	1396 KB	Output is correct
26	Correct	42 ms	1212 KB	Output is correct
27	Correct	41 ms	1212 KB	Output is correct
28	Correct	42 ms	1204 KB	Output is correct
29	Correct	43 ms	1440 KB	Output is correct
30	Correct	26 ms	1180 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct