Submission #111869

# Submission time Handle Problem Language Result Execution time Memory
111869 2019-05-16T13:04:11 Z dupreez Gap (APIO16_gap) C++14
30 / 100
61 ms 1176 KB
#include "gap.h"
#include <vector>
#include <algorithm>
typedef long long int ll;
using namespace std;

pair<ll, ll> MinMax(ll v1, ll v2) {
	ll vv1, vv2;
	MinMax(v1, v2, &vv1, &vv2);
	return make_pair(vv1, vv2);
}

long long findGap(int T, int N)
{
	ll ans = 1;
	pair<ll, ll> cv = MinMax(0, 1000000000000000000);
	for (int i = 1; i < N / 2; i++) {
		pair<ll, ll> nv = MinMax(cv.first + 1, cv.second - 1);
		ans = max({ ans,nv.first - cv.first,cv.second - nv.second });
		cv = nv;
	}
	if (N % 2 == 1) {
		pair<ll, ll> nv = MinMax(cv.first + 1, cv.second - 1);
		ans = max({ ans,nv.first - cv.first,cv.second - nv.second });
		cv = nv;
	}
	else ans = max(ans, cv.second - cv.first);
	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 2 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 14 ms 512 KB Output is correct
17 Correct 14 ms 512 KB Output is correct
18 Correct 18 ms 512 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 54 ms 1144 KB Output is correct
22 Correct 51 ms 1112 KB Output is correct
23 Correct 52 ms 1144 KB Output is correct
24 Correct 52 ms 1144 KB Output is correct
25 Correct 43 ms 1024 KB Output is correct
26 Correct 51 ms 1016 KB Output is correct
27 Correct 46 ms 1016 KB Output is correct
28 Correct 50 ms 1016 KB Output is correct
29 Correct 46 ms 1024 KB Output is correct
30 Correct 43 ms 1024 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Partially correct 2 ms 256 KB Partially correct
3 Partially correct 2 ms 256 KB Partially correct
4 Partially correct 2 ms 384 KB Partially correct
5 Partially correct 3 ms 384 KB Partially correct
6 Partially correct 3 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 2 ms 384 KB Partially correct
10 Partially correct 3 ms 384 KB Partially correct
11 Partially correct 4 ms 384 KB Partially correct
12 Partially correct 3 ms 384 KB Partially correct
13 Partially correct 3 ms 384 KB Partially correct
14 Partially correct 3 ms 384 KB Partially correct
15 Partially correct 3 ms 384 KB Partially correct
16 Partially correct 13 ms 512 KB Partially correct
17 Partially correct 13 ms 512 KB Partially correct
18 Partially correct 13 ms 512 KB Partially correct
19 Partially correct 16 ms 512 KB Partially correct
20 Partially correct 9 ms 512 KB Partially correct
21 Incorrect 51 ms 1152 KB Expected int32, but "2500100000" found
22 Incorrect 48 ms 1020 KB Expected int32, but "2500100000" found
23 Incorrect 47 ms 1144 KB Expected int32, but "2500100000" found
24 Incorrect 48 ms 1152 KB Expected int32, but "2500100000" found
25 Incorrect 41 ms 1024 KB Expected int32, but "2500100000" found
26 Incorrect 51 ms 1148 KB Expected int32, but "2500100000" found
27 Incorrect 61 ms 1056 KB Expected int32, but "2500100000" found
28 Incorrect 49 ms 1148 KB Expected int32, but "2500100000" found
29 Incorrect 54 ms 1176 KB Expected int32, but "2500100000" found
30 Incorrect 34 ms 1024 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 300 KB Partially correct
32 Partially correct 3 ms 384 KB Partially correct