Submission #967911

# Submission time Handle Problem Language Result Execution time Memory
967911 2024-04-23T05:07:34 Z TAhmed33 Gap (APIO16_gap) C++
30 / 100
43 ms 5008 KB
#include <bits/stdc++.h>
#pragma GCC optimize ("trapv")
#include "gap.h"
//#include "grader.cpp"
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;
	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 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 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 1 ms 2392 KB Output is correct
16 Correct 7 ms 2588 KB Output is correct
17 Correct 8 ms 2584 KB Output is correct
18 Correct 7 ms 2736 KB Output is correct
19 Correct 7 ms 2584 KB Output is correct
20 Correct 6 ms 2572 KB Output is correct
21 Correct 30 ms 2860 KB Output is correct
22 Correct 27 ms 2856 KB Output is correct
23 Correct 29 ms 2860 KB Output is correct
24 Correct 27 ms 2860 KB Output is correct
25 Correct 24 ms 2852 KB Output is correct
26 Correct 28 ms 2792 KB Output is correct
27 Correct 28 ms 2856 KB Output is correct
28 Correct 27 ms 2860 KB Output is correct
29 Correct 27 ms 2856 KB Output is correct
30 Correct 22 ms 3096 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 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 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Incorrect 1 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 2552 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 3008 KB Output is correct
17 Correct 10 ms 2956 KB Output is correct
18 Correct 12 ms 2964 KB Output is correct
19 Correct 10 ms 2952 KB Output is correct
20 Correct 5 ms 2568 KB Output is correct
21 Correct 40 ms 3904 KB Output is correct
22 Correct 39 ms 3992 KB Output is correct
23 Correct 40 ms 3876 KB Output is correct
24 Correct 39 ms 4000 KB Output is correct
25 Correct 38 ms 5008 KB Output is correct
26 Correct 43 ms 3828 KB Output is correct
27 Correct 40 ms 3876 KB Output is correct
28 Correct 40 ms 4032 KB Output is correct
29 Correct 40 ms 4004 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