답안 #1085164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085164	2024-09-07T16:21:04 Z	Timosh	Gap (APIO16_gap)	C++17	100 / 100	51 ms	5912 KB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

long long mn = 0, mx = 0;
set<long long> st;

long long findGap(int T, int N)
{
	long long lim = 1e18;
	long long ans = 1;
	long long n = N;
	if (T == 2 && N >= 4)
	{
		MinMax(0, lim, &mn, &mx);
		long long left = mn;
		long long l = mn + 1, r = mx - 1;
		long long ans = 1;
		long long last = mn;
		if (mx - mn == N - 1)
			return 1;
		if (mx - mn == N)
			return 2;
		for (int i = 0; i < N; i++)
		{
			long long nxt = l + (r - left) / n - 1 + (i >= n - (r - left) % n && (r - left) % n);
			MinMax(l, nxt, &mn, &mx);
			l = nxt + 1;
			if (mn != -1)
			{
				ans = max(ans, mn - last);
				last = mx;
			}
		}
		ans = max(ans, r - last + 1);
		return ans;
	}
	else
	{
		long long l = 0, r = 1e18;
		while (1)
		{
			MinMax(l, r, &mn, &mx);
			if (mn == -1)
				break;
			st.insert(mn);
			st.insert(mx);
			l = mn + 1, r = mx - 1;
			if (mn == mx || (long long)st.size() >= N)
				break;
		}
	}
	long long last = *st.begin();
	for (auto &i : st)
		ans = max(ans, i - last), last = i;
	return ans;
}

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	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	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	388 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	10 ms	1624 KB	Output is correct
17	Correct	12 ms	1624 KB	Output is correct
18	Correct	12 ms	1624 KB	Output is correct
19	Correct	9 ms	1624 KB	Output is correct
20	Correct	11 ms	1624 KB	Output is correct
21	Correct	42 ms	5712 KB	Output is correct
22	Correct	40 ms	5712 KB	Output is correct
23	Correct	40 ms	5712 KB	Output is correct
24	Correct	51 ms	5712 KB	Output is correct
25	Correct	38 ms	5712 KB	Output is correct
26	Correct	48 ms	5712 KB	Output is correct
27	Correct	40 ms	5712 KB	Output is correct
28	Correct	51 ms	5912 KB	Output is correct
29	Correct	47 ms	5712 KB	Output is correct
30	Correct	39 ms	5712 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct

Subtask #2

70.0 / 70.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	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	Correct	1 ms	344 KB	Output is correct
16	Correct	9 ms	600 KB	Output is correct
17	Correct	9 ms	432 KB	Output is correct
18	Correct	12 ms	600 KB	Output is correct
19	Correct	9 ms	600 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	43 ms	1168 KB	Output is correct
22	Correct	42 ms	1224 KB	Output is correct
23	Correct	42 ms	1112 KB	Output is correct
24	Correct	35 ms	1112 KB	Output is correct
25	Correct	33 ms	1112 KB	Output is correct
26	Correct	36 ms	1212 KB	Output is correct
27	Correct	37 ms	1112 KB	Output is correct
28	Correct	43 ms	1112 KB	Output is correct
29	Correct	43 ms	1112 KB	Output is correct
30	Correct	28 ms	1112 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct