Submission #45036

# Submission time Handle Problem Language Result Execution time Memory
45036 2018-04-11T04:31:18 Z Mamnoon_Siam Gap (APIO16_gap) C++17
30 / 100
71 ms 2676 KB
#include <bits/stdc++.h>
using namespace std;

int n;

typedef long long ll;

void MinMax(ll, ll, ll*, ll*);

ll solve_naive() {
	ll l = 0, r = 1000000000000000000LL;
	vector<ll> v;
	int lim = (n + 1) / 2;
	for(int i=1; i<=lim; i++) {
		ll x, y;
		MinMax(l, r, &x, &y);
		v.push_back(x);
		if(x != y) v.push_back(y);
		l = x + 1;
		r = y - 1;
	}
	sort(v.begin(), v.end());
	ll ret = 0;
	for(int i=1; i<(ll)v.size(); i++) {
		ret = max(ret, v[i] - v[i-1]);
	} return ret;
}

ll solve_proway() {
	return 0;
}

long long findGap(int32_t T, int32_t N)
{
	n = N;
	if(T == 1) return solve_naive();
	else return solve_proway();
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 652 KB Output is correct
6 Correct 2 ms 652 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 652 KB Output is correct
11 Correct 3 ms 652 KB Output is correct
12 Correct 3 ms 652 KB Output is correct
13 Correct 3 ms 652 KB Output is correct
14 Correct 3 ms 652 KB Output is correct
15 Correct 2 ms 652 KB Output is correct
16 Correct 16 ms 1232 KB Output is correct
17 Correct 17 ms 1232 KB Output is correct
18 Correct 17 ms 1232 KB Output is correct
19 Correct 22 ms 1232 KB Output is correct
20 Correct 14 ms 1232 KB Output is correct
21 Correct 69 ms 2548 KB Output is correct
22 Correct 63 ms 2548 KB Output is correct
23 Correct 62 ms 2676 KB Output is correct
24 Correct 71 ms 2676 KB Output is correct
25 Correct 56 ms 2676 KB Output is correct
26 Correct 68 ms 2676 KB Output is correct
27 Correct 66 ms 2676 KB Output is correct
28 Correct 62 ms 2676 KB Output is correct
29 Correct 66 ms 2676 KB Output is correct
30 Correct 48 ms 2676 KB Output is correct
31 Correct 2 ms 2676 KB Output is correct
32 Correct 2 ms 2676 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2676 KB Output isn't correct
2 Incorrect 2 ms 2676 KB Output isn't correct
3 Incorrect 2 ms 2676 KB Output isn't correct
4 Incorrect 2 ms 2676 KB Output isn't correct
5 Incorrect 2 ms 2676 KB Output isn't correct
6 Incorrect 2 ms 2676 KB Output isn't correct
7 Incorrect 2 ms 2676 KB Output isn't correct
8 Incorrect 2 ms 2676 KB Output isn't correct
9 Incorrect 2 ms 2676 KB Output isn't correct
10 Incorrect 1 ms 2676 KB Output isn't correct
11 Incorrect 2 ms 2676 KB Output isn't correct
12 Incorrect 3 ms 2676 KB Output isn't correct
13 Incorrect 2 ms 2676 KB Output isn't correct
14 Incorrect 2 ms 2676 KB Output isn't correct
15 Incorrect 2 ms 2676 KB Output isn't correct
16 Incorrect 9 ms 2676 KB Output isn't correct
17 Incorrect 9 ms 2676 KB Output isn't correct
18 Incorrect 8 ms 2676 KB Output isn't correct
19 Incorrect 9 ms 2676 KB Output isn't correct
20 Incorrect 5 ms 2676 KB Output isn't correct
21 Incorrect 36 ms 2676 KB Output isn't correct
22 Incorrect 29 ms 2676 KB Output isn't correct
23 Incorrect 30 ms 2676 KB Output isn't correct
24 Incorrect 32 ms 2676 KB Output isn't correct
25 Incorrect 23 ms 2676 KB Output isn't correct
26 Incorrect 29 ms 2676 KB Output isn't correct
27 Incorrect 30 ms 2676 KB Output isn't correct
28 Incorrect 30 ms 2676 KB Output isn't correct
29 Incorrect 31 ms 2676 KB Output isn't correct
30 Incorrect 16 ms 2676 KB Output isn't correct
31 Incorrect 2 ms 2676 KB Output isn't correct
32 Incorrect 2 ms 2676 KB Output isn't correct