Submission #844816

# Submission time Handle Problem Language Result Execution time Memory
844816 2023-09-06T01:43:48 Z dutinmeow Gap (APIO16_gap) C++17
100 / 100
42 ms 4164 KB
#include <bits/stdc++.h>
using namespace std;
 
#include "gap.h"
 
const long long MAX_A = 1e18;
 
long long findGap(int T, int N) {
	if (T == 1) {
		long long l = 1, r = MAX_A;
		vector<long long> A;
		for (int i = 0; i < (N + 1) / 2; i++) {
			long long nl, nr;
			MinMax(l, r, &nl, &nr);
			A.push_back(nl);
			A.push_back(nr);
			l = nl + 1, r = nr - 1;
		}
		sort(A.begin(), A.begin() + N);
		long long ans = 0;
		for (int i = 1; i < N; i++)	
			ans = max(ans, A[i] - A[i - 1]);
		return ans;
	} else {
		long long l, r;
		MinMax(1, MAX_A, &l, &r);
		long long step = (r - l) / (N - 1);
		long long lb, ans = step;
		for (lb = l; lb + step < r; lb += step + 1) {
			long long nl, nr;
			MinMax(lb, lb + step, &nl, &nr);
			if (nl != -1 && nr != -1) {
				ans = max(ans, nl - l);
				l = nr;
			}
		} 
		long long nl, nr;
		MinMax(lb, r, &nl, &nr);
		if (nl != -1 && nr != -1) 
			ans = max(ans, nl - l);
		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 0 ms 2392 KB Output is correct
4 Correct 0 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 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 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 8 ms 2840 KB Output is correct
17 Correct 8 ms 2908 KB Output is correct
18 Correct 10 ms 3008 KB Output is correct
19 Correct 8 ms 2836 KB Output is correct
20 Correct 7 ms 2824 KB Output is correct
21 Correct 31 ms 3996 KB Output is correct
22 Correct 31 ms 3932 KB Output is correct
23 Correct 31 ms 3916 KB Output is correct
24 Correct 34 ms 4164 KB Output is correct
25 Correct 28 ms 3996 KB Output is correct
26 Correct 31 ms 3996 KB Output is correct
27 Correct 32 ms 3816 KB Output is correct
28 Correct 32 ms 4000 KB Output is correct
29 Correct 31 ms 4000 KB Output is correct
30 Correct 30 ms 3848 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 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 1 ms 2388 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2448 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 2548 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 2488 KB Output is correct
16 Correct 9 ms 2584 KB Output is correct
17 Correct 9 ms 2752 KB Output is correct
18 Correct 10 ms 2580 KB Output is correct
19 Correct 9 ms 2576 KB Output is correct
20 Correct 5 ms 2568 KB Output is correct
21 Correct 39 ms 2864 KB Output is correct
22 Correct 38 ms 2852 KB Output is correct
23 Correct 42 ms 3104 KB Output is correct
24 Correct 39 ms 2860 KB Output is correct
25 Correct 40 ms 2860 KB Output is correct
26 Correct 39 ms 2852 KB Output is correct
27 Correct 39 ms 2860 KB Output is correct
28 Correct 38 ms 2848 KB Output is correct
29 Correct 39 ms 2856 KB Output is correct
30 Correct 21 ms 2848 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct