답안 #1083412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083412	2024-09-03T05:33:56 Z	djs100201	Gap (APIO16_gap)	C++17	100 / 100	35 ms	2360 KB

gap

#include "gap.h"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ = 2e5 + 10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll findGap(int T, int N) {
	if (T == 1) {
		vector<ll> res(N);
		ll l = 0, r = 1e18, mn, mx, lidx = 0, ridx = N - 1;
		for (int i = 0; i < (N + 1) / 2; i++) {
			MinMax(l, r, &mn, &mx);
			res[lidx++] = mn, res[ridx--] = mx;
			l = mn + 1, r = mx - 1;
		}

		ll ret = 0;
		for (int i = 1; i < N; i++)
			ret = max(ret, res[i] - res[i - 1]);
		return ret;
	} else {
		ll l = 0, r = 1e18, ret = 0, mn, mx;
		MinMax(l, r, &mn, &mx);
		r = mx;
		ll gap = mx - mn, new_gap = gap / N;
		ret = new_gap;
		vector<ll> R;
		R.push_back(mn);
		ll x = mn;
		while (1) {
			MinMax(x + 1, x + ret + 1, &mn, &mx);
			if (mx == -1) {
				x += ret + 1;
			} else {
				ret = max(ret, mn - R.back());
				x = mx;
				R.push_back(mx);
			}
			if (x == r)
				break;
		}
		return ret;
	}
}

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	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	0 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	6 ms	1108 KB	Output is correct
17	Correct	9 ms	856 KB	Output is correct
18	Correct	8 ms	660 KB	Output is correct
19	Correct	7 ms	856 KB	Output is correct
20	Correct	5 ms	660 KB	Output is correct
21	Correct	27 ms	2016 KB	Output is correct
22	Correct	26 ms	1888 KB	Output is correct
23	Correct	25 ms	1880 KB	Output is correct
24	Correct	35 ms	1908 KB	Output is correct
25	Correct	23 ms	1880 KB	Output is correct
26	Correct	28 ms	1880 KB	Output is correct
27	Correct	29 ms	1880 KB	Output is correct
28	Correct	26 ms	1880 KB	Output is correct
29	Correct	26 ms	1880 KB	Output is correct
30	Correct	21 ms	1880 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	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	340 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	4 ms	600 KB	Output is correct
17	Correct	5 ms	600 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	4 ms	600 KB	Output is correct
20	Correct	3 ms	600 KB	Output is correct
21	Correct	16 ms	1196 KB	Output is correct
22	Correct	18 ms	1272 KB	Output is correct
23	Correct	17 ms	1368 KB	Output is correct
24	Correct	17 ms	1368 KB	Output is correct
25	Correct	35 ms	2360 KB	Output is correct
26	Correct	18 ms	1356 KB	Output is correct
27	Correct	22 ms	1368 KB	Output is correct
28	Correct	17 ms	1368 KB	Output is correct
29	Correct	25 ms	1360 KB	Output is correct
30	Correct	13 ms	1112 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct