답안 #882305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882305 2023-12-03T03:30:42 Z ono_de206 Gap (APIO16_gap) C++14
100 / 100
44 ms 4036 KB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

long long findGap(int T, int N) {
	long long qn, qx;

	auto ask = [&](long long l, long long r) -> void {
		assert(l <= r);
		MinMax(l, r, &qn, &qx);
	};

	if(T == 1) {
		vector<long long> a(N);
		long long l = 0, r = (long long)1e18;
		for(int i = 0, j = N - 1; i <= j; i++, j--) {
			ask(l, r);
			a[i] = qn;
			a[j] = qx;
			l = qn + 1;
			r = qx - 1;
		}
		long long ans = 0;
		for(int i = 1; i < N; i++) {
			ans = max(ans, a[i] - a[i - 1]);
		}
		return ans;
	}

	long long sus1 = 0, sus2 = (long long)1e18;

	ask(sus1, sus2);

	long long mn = qn, mx = qx, ans = 0;
	long long d = (mx - mn + N - 1) / N;
	long long ls = mn, l = mn + 1;
	while(l <= mx) {
		long long r = l + d - 1;
		ask(l, r);
		if(qn != -1) {
			ans = max(ans, qn - ls);
			ls = qx;
		}
		l = r + 1;
	}
	return ans;
}
# 결과 실행 시간 메모리 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 1 ms 2388 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 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 1 ms 2392 KB Output is correct
16 Correct 10 ms 2584 KB Output is correct
17 Correct 8 ms 2600 KB Output is correct
18 Correct 8 ms 2584 KB Output is correct
19 Correct 7 ms 2588 KB Output is correct
20 Correct 7 ms 2556 KB Output is correct
21 Correct 30 ms 3624 KB Output is correct
22 Correct 36 ms 3624 KB Output is correct
23 Correct 30 ms 3628 KB Output is correct
24 Correct 31 ms 3616 KB Output is correct
25 Correct 27 ms 3620 KB Output is correct
26 Correct 30 ms 3620 KB Output is correct
27 Correct 34 ms 4036 KB Output is correct
28 Correct 32 ms 3596 KB Output is correct
29 Correct 30 ms 3628 KB Output is correct
30 Correct 25 ms 3624 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 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 0 ms 2484 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 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 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 10 ms 2680 KB Output is correct
17 Correct 14 ms 2576 KB Output is correct
18 Correct 10 ms 2592 KB Output is correct
19 Correct 12 ms 2588 KB Output is correct
20 Correct 6 ms 2572 KB Output is correct
21 Correct 42 ms 2860 KB Output is correct
22 Correct 44 ms 2852 KB Output is correct
23 Correct 41 ms 2864 KB Output is correct
24 Correct 42 ms 2860 KB Output is correct
25 Correct 41 ms 2864 KB Output is correct
26 Correct 43 ms 2856 KB Output is correct
27 Correct 41 ms 2860 KB Output is correct
28 Correct 42 ms 3112 KB Output is correct
29 Correct 42 ms 2852 KB Output is correct
30 Correct 27 ms 2848 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct