Submission #1101329

# Submission time Handle Problem Language Result Execution time Memory
1101329 2024-10-16T05:46:26 Z huyngo Gap (APIO16_gap) C++17
86.3068 / 100
50 ms 4220 KB
#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 x, y;
	MinMax(0, 1e18, &x, &y);
	ll step = (y - x) / (N - 1);
	ll res = step, prv = x;
	++x;
	for (ll u, v; x <= y; ) {
		MinMax(x, x + step, &u, &v);
		if (u != -1) {
			res = max(res, u - prv);
			prv = v;
			x = v + 1;
		}
		else
			x += step;
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 11 ms 1484 KB Output is correct
17 Correct 9 ms 1484 KB Output is correct
18 Correct 9 ms 1484 KB Output is correct
19 Correct 8 ms 1408 KB Output is correct
20 Correct 7 ms 1432 KB Output is correct
21 Correct 40 ms 4216 KB Output is correct
22 Correct 34 ms 4028 KB Output is correct
23 Correct 35 ms 3992 KB Output is correct
24 Correct 32 ms 4028 KB Output is correct
25 Correct 34 ms 4220 KB Output is correct
26 Correct 32 ms 4060 KB Output is correct
27 Correct 38 ms 4044 KB Output is correct
28 Correct 32 ms 4028 KB Output is correct
29 Correct 37 ms 4144 KB Output is correct
30 Correct 28 ms 4036 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Partially correct 1 ms 336 KB Partially correct
3 Partially correct 1 ms 336 KB Partially correct
4 Partially correct 1 ms 336 KB Partially correct
5 Correct 1 ms 336 KB Output is correct
6 Partially correct 1 ms 336 KB Partially correct
7 Partially correct 1 ms 504 KB Partially correct
8 Partially correct 1 ms 336 KB Partially correct
9 Partially correct 1 ms 336 KB Partially correct
10 Partially correct 1 ms 336 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Correct 1 ms 336 KB Output is correct
16 Partially correct 9 ms 592 KB Partially correct
17 Partially correct 9 ms 592 KB Partially correct
18 Partially correct 12 ms 648 KB Partially correct
19 Partially correct 11 ms 592 KB Partially correct
20 Partially correct 7 ms 592 KB Partially correct
21 Partially correct 50 ms 1208 KB Partially correct
22 Partially correct 39 ms 1104 KB Partially correct
23 Partially correct 39 ms 1104 KB Partially correct
24 Partially correct 42 ms 1104 KB Partially correct
25 Correct 39 ms 1104 KB Output is correct
26 Partially correct 39 ms 1104 KB Partially correct
27 Partially correct 48 ms 1104 KB Partially correct
28 Partially correct 50 ms 1104 KB Partially correct
29 Partially correct 39 ms 1104 KB Partially correct
30 Partially correct 23 ms 1104 KB Partially correct
31 Partially correct 1 ms 336 KB Partially correct
32 Partially correct 1 ms 340 KB Partially correct