Submission #967910

# Submission time Handle Problem Language Result Execution time Memory
967910 2024-04-23T05:05:12 Z TAhmed33 Gap (APIO16_gap) C++
30 / 100
46 ms 5016 KB
#include <bits/stdc++.h>
#pragma GCC optimize ("trapv")
#include "gap.h"
using namespace std;
typedef long long ll;
const ll inf = 1e18;
pair <ll, ll> ask (ll l, ll r) {
	if (l > r) return {-1, -1};
	ll mn = l, mx = r;
	MinMax(l, r, &mn, &mx);
	return {mn, mx};
}
ll findGap (int t, int n) {
	if (t == 1) {
		auto g = ask(0, inf); n -= 2;
		if (!n) {
			return g.second - g.first;
		}
		ll ans = 0;
		while (n >= 1) {
			auto h = ask(g.first + 1, g.second - 1);
			if (h.first == -1) {
				ans = max(ans, g.second - g.first);
				break;
			}
			assert(g.first < h.first && h.first <= h.second && h.second < g.second);
			ans = max(ans, g.second - h.second);
			ans = max(ans, h.first - g.first);
			g = h;
			n -= 2;
		}
		return ans;
	}
	auto g = ask(0, inf);
	ll L = g.second - g.first + 1;
	ll x = (L + n - 2) / (n - 1);
	ll ans = x;
	vector <pair <ll, ll>> dd;
	for (ll i = g.first; i + x <= g.second; i += x + 1) {
		auto h = ask(i, min(g.second, i + x));
		if (h.first != -1) dd.push_back(h);
	}
	for (int i = 1; i < (int)dd.size(); i++) ans = max(ans, dd[i].first - dd[i - 1].second);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 2 ms 2392 KB Output is correct
16 Correct 7 ms 2584 KB Output is correct
17 Correct 7 ms 2756 KB Output is correct
18 Correct 8 ms 2516 KB Output is correct
19 Correct 7 ms 2600 KB Output is correct
20 Correct 6 ms 2596 KB Output is correct
21 Correct 28 ms 2864 KB Output is correct
22 Correct 28 ms 2856 KB Output is correct
23 Correct 28 ms 2868 KB Output is correct
24 Correct 28 ms 2864 KB Output is correct
25 Correct 24 ms 2864 KB Output is correct
26 Correct 27 ms 2860 KB Output is correct
27 Correct 28 ms 2876 KB Output is correct
28 Correct 30 ms 2860 KB Output is correct
29 Correct 28 ms 2864 KB Output is correct
30 Correct 22 ms 2876 KB Output is correct
31 Correct 1 ms 2400 KB Output is correct
32 Correct 0 ms 2400 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2400 KB Output isn't correct
2 Correct 1 ms 2592 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Incorrect 0 ms 2392 KB Output isn't correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2492 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Correct 10 ms 2964 KB Output is correct
17 Correct 10 ms 2944 KB Output is correct
18 Correct 10 ms 2948 KB Output is correct
19 Correct 10 ms 2964 KB Output is correct
20 Correct 5 ms 2572 KB Output is correct
21 Correct 40 ms 4000 KB Output is correct
22 Correct 46 ms 4028 KB Output is correct
23 Correct 40 ms 4224 KB Output is correct
24 Correct 41 ms 3908 KB Output is correct
25 Incorrect 39 ms 5016 KB Output isn't correct
26 Correct 40 ms 4280 KB Output is correct
27 Correct 40 ms 3996 KB Output is correct
28 Correct 40 ms 4000 KB Output is correct
29 Correct 40 ms 3992 KB Output is correct
30 Correct 21 ms 3112 KB Output is correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Correct 1 ms 2392 KB Output is correct