Submission #106949

# Submission time Handle Problem Language Result Execution time Memory
106949 2019-04-21T10:03:04 Z maksim_gaponov Gap (APIO16_gap) C++14
30 / 100
61 ms 1200 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int MAX = 1e18;

int findGap(signed T, signed N) {
	// cout << T << ' ' << N << endl;
	int l = 0;
	int r = MAX;
	int CNT = 0;
	MinMax(l, r, &l, &r);
	++CNT;
	int ans = 0;
	int step = 1;
	while (r != l) {
		if (2 * step == N || r - l == 1) {
			ans = max(ans, r - l);
			break;
		}
		int nl;
		int nr;
		MinMax(l + 1, r - 1, &nl, &nr);
		++CNT;
		if (nl != -1) {
			ans = max(ans, r - nr);
			ans = max(ans, nl - l);
		} else {
			ans = max(ans, r - l);
		}
		step++;
		r = nr;
		l = nl;
		// cout << r << ' ';
	}
	// cout << endl;
	// assert(2 * CNT <= N + 1);
	assert(ans != 2500100000ll);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 12 ms 512 KB Output is correct
17 Correct 13 ms 512 KB Output is correct
18 Correct 14 ms 512 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 11 ms 640 KB Output is correct
21 Correct 48 ms 1144 KB Output is correct
22 Correct 45 ms 1152 KB Output is correct
23 Correct 51 ms 1144 KB Output is correct
24 Correct 52 ms 1144 KB Output is correct
25 Correct 52 ms 1152 KB Output is correct
26 Correct 61 ms 1144 KB Output is correct
27 Correct 51 ms 1144 KB Output is correct
28 Correct 51 ms 1132 KB Output is correct
29 Correct 45 ms 1152 KB Output is correct
30 Correct 35 ms 1152 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Partially correct 0 ms 384 KB Partially correct
3 Partially correct 2 ms 384 KB Partially correct
4 Partially correct 2 ms 384 KB Partially correct
5 Partially correct 2 ms 256 KB Partially correct
6 Partially correct 2 ms 384 KB Partially correct
7 Partially correct 2 ms 384 KB Partially correct
8 Partially correct 2 ms 384 KB Partially correct
9 Partially correct 3 ms 384 KB Partially correct
10 Partially correct 2 ms 384 KB Partially correct
11 Partially correct 2 ms 384 KB Partially correct
12 Partially correct 3 ms 384 KB Partially correct
13 Partially correct 3 ms 512 KB Partially correct
14 Partially correct 4 ms 384 KB Partially correct
15 Partially correct 3 ms 384 KB Partially correct
16 Partially correct 14 ms 512 KB Partially correct
17 Partially correct 13 ms 512 KB Partially correct
18 Partially correct 12 ms 512 KB Partially correct
19 Partially correct 14 ms 512 KB Partially correct
20 Partially correct 10 ms 512 KB Partially correct
21 Incorrect 45 ms 1152 KB Expected int32, but "2500100000" found
22 Incorrect 47 ms 1144 KB Expected int32, but "2500100000" found
23 Incorrect 45 ms 1196 KB Expected int32, but "2500100000" found
24 Incorrect 53 ms 1144 KB Expected int32, but "2500100000" found
25 Incorrect 40 ms 1124 KB Expected int32, but "2500100000" found
26 Incorrect 46 ms 1144 KB Expected int32, but "2500100000" found
27 Incorrect 49 ms 1144 KB Expected int32, but "2500100000" found
28 Incorrect 46 ms 1152 KB Expected int32, but "2500100000" found
29 Incorrect 48 ms 1200 KB Expected int32, but "2500100000" found
30 Incorrect 42 ms 1144 KB Expected int32, but "2500100000" found
31 Partially correct 3 ms 384 KB Partially correct
32 Partially correct 2 ms 384 KB Partially correct