답안 #967917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967917 2024-04-23T05:14:52 Z TAhmed33 Gap (APIO16_gap) C++
100 / 100
49 ms 5200 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 <= 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);
	ans = max(ans, g.second - dd.back().second);
	ans = max(ans, dd.front().first - g.first);
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 0 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 1 ms 2392 KB Output is correct
16 Correct 7 ms 2752 KB Output is correct
17 Correct 8 ms 2592 KB Output is correct
18 Correct 7 ms 2588 KB Output is correct
19 Correct 8 ms 2592 KB Output is correct
20 Correct 6 ms 2564 KB Output is correct
21 Correct 28 ms 2848 KB Output is correct
22 Correct 30 ms 3108 KB Output is correct
23 Correct 29 ms 2856 KB Output is correct
24 Correct 29 ms 2860 KB Output is correct
25 Correct 25 ms 2848 KB Output is correct
26 Correct 28 ms 2856 KB Output is correct
27 Correct 30 ms 2860 KB Output is correct
28 Correct 28 ms 2852 KB Output is correct
29 Correct 28 ms 2856 KB Output is correct
30 Correct 32 ms 2832 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 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 0 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 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 2 ms 2392 KB Output is correct
15 Correct 1 ms 2492 KB Output is correct
16 Correct 10 ms 2964 KB Output is correct
17 Correct 10 ms 2964 KB Output is correct
18 Correct 11 ms 3132 KB Output is correct
19 Correct 11 ms 2960 KB Output is correct
20 Correct 7 ms 2536 KB Output is correct
21 Correct 45 ms 3980 KB Output is correct
22 Correct 44 ms 3928 KB Output is correct
23 Correct 40 ms 4012 KB Output is correct
24 Correct 43 ms 4016 KB Output is correct
25 Correct 40 ms 5200 KB Output is correct
26 Correct 41 ms 3972 KB Output is correct
27 Correct 41 ms 4012 KB Output is correct
28 Correct 49 ms 4012 KB Output is correct
29 Correct 42 ms 4008 KB Output is correct
30 Correct 21 ms 3108 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct