답안 #1104426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104426	2024-10-23T17:58:28 Z	codexistent	Gap (APIO16_gap)	C++14	100 / 100	46 ms	5828 KB

gap

// testing, nmc
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
long long findGap(int T, int N) {
	if (T == 1) {
		vector<ll> a;
		auto calc = [&](auto self, ll l, ll r) -> void {
			if (l > r || (int)a.size() == N) return;
			ll x, y;
			MinMax(l, r, &x, &y);
			if (x != -1)
				a.push_back(x);
			if (y != x)
				a.push_back(y);
			self(self, x + 1, y - 1);
			};
		calc(calc, 0, 1e18);
		sort(a.begin(), a.end());
		ll res = a[1] - a[0];
		for (int i = 2; i < N; ++i)
			res = max(res, a[i] - a[i - 1]);
		return res;
	}
 
	ll mn, mx;
	MinMax(1, 1e18, &mn, &mx);
	ll step = (mx - mn) / (N - 1);
	ll ans = step, x, y, l = mn, i;
	for (i = mn; i + step < mx; i += step + 1) {
		MinMax(i, i + step, &x, &y);
		if (x != -1) {
			ans = max(ans, x - l);
			l = y;
		}
	}
	MinMax(i, mx, &x, &y);
	if (x != -1) ans = max(ans, x - l);
	return ans;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	2 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	2 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	8 ms	3388 KB	Output is correct
17	Correct	8 ms	3276 KB	Output is correct
18	Correct	9 ms	3276 KB	Output is correct
19	Correct	11 ms	3276 KB	Output is correct
20	Correct	7 ms	3216 KB	Output is correct
21	Correct	32 ms	5820 KB	Output is correct
22	Correct	32 ms	5828 KB	Output is correct
23	Correct	41 ms	5784 KB	Output is correct
24	Correct	32 ms	5640 KB	Output is correct
25	Correct	29 ms	5828 KB	Output is correct
26	Correct	32 ms	5672 KB	Output is correct
27	Correct	34 ms	5784 KB	Output is correct
28	Correct	39 ms	5804 KB	Output is correct
29	Correct	35 ms	5820 KB	Output is correct
30	Correct	35 ms	5820 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	1 ms	2384 KB	Output is correct

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2552 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2552 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	2 ms	2556 KB	Output is correct
14	Correct	2 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	14 ms	2384 KB	Output is correct
17	Correct	9 ms	2384 KB	Output is correct
18	Correct	9 ms	2384 KB	Output is correct
19	Correct	10 ms	2384 KB	Output is correct
20	Correct	6 ms	2384 KB	Output is correct
21	Correct	39 ms	2736 KB	Output is correct
22	Correct	42 ms	2640 KB	Output is correct
23	Correct	37 ms	2640 KB	Output is correct
24	Correct	46 ms	2640 KB	Output is correct
25	Correct	36 ms	2640 KB	Output is correct
26	Correct	36 ms	2640 KB	Output is correct
27	Correct	42 ms	2640 KB	Output is correct
28	Correct	43 ms	2640 KB	Output is correct
29	Correct	37 ms	2640 KB	Output is correct
30	Correct	21 ms	2640 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	1 ms	2384 KB	Output is correct