Submission #108023

# Submission time Handle Problem Language Result Execution time Memory
108023 2019-04-26T22:37:17 Z luciocf Gap (APIO16_gap) C++14
30 / 100
70 ms 2008 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

const int maxn = 1e5+10;
const long long maxv = 1e18;

typedef long long ll;

ll a[maxn];

long long findGap(int T, int N)
{
	if (T == 1)
	{
		ll mn, mx;
		MinMax(0, maxv, &mn, &mx);

		int l = 1, r = N;
		a[1] = mn, a[N] = mx;

		while (true)
		{
			if (r-l <= 1) break;

			MinMax(a[l]+1, a[r]-1, &mn, &mx);

			a[++l] = mn, a[--r] = mx;
		}

		ll ans = 0;
		for (int i = 1; i < N; i++)
			ans = max(ans, a[i+1]-a[i]);

		return ans;
	}

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 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 3 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 2 ms 384 KB Output is correct
11 Correct 3 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 3 ms 384 KB Output is correct
16 Correct 14 ms 768 KB Output is correct
17 Correct 14 ms 768 KB Output is correct
18 Correct 18 ms 768 KB Output is correct
19 Correct 20 ms 768 KB Output is correct
20 Correct 14 ms 768 KB Output is correct
21 Correct 62 ms 1916 KB Output is correct
22 Correct 57 ms 1936 KB Output is correct
23 Correct 52 ms 1912 KB Output is correct
24 Correct 48 ms 2008 KB Output is correct
25 Correct 40 ms 1912 KB Output is correct
26 Correct 51 ms 1916 KB Output is correct
27 Correct 70 ms 1912 KB Output is correct
28 Correct 61 ms 1912 KB Output is correct
29 Correct 51 ms 1912 KB Output is correct
30 Correct 40 ms 1912 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 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Incorrect 3 ms 384 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 2 ms 384 KB Output isn't correct
12 Incorrect 3 ms 384 KB Output isn't correct
13 Incorrect 3 ms 384 KB Output isn't correct
14 Incorrect 2 ms 384 KB Output isn't correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Incorrect 8 ms 512 KB Output isn't correct
17 Incorrect 11 ms 512 KB Output isn't correct
18 Incorrect 9 ms 512 KB Output isn't correct
19 Incorrect 9 ms 640 KB Output isn't correct
20 Incorrect 5 ms 512 KB Output isn't correct
21 Incorrect 30 ms 1156 KB Output isn't correct
22 Incorrect 28 ms 1152 KB Output isn't correct
23 Incorrect 26 ms 1144 KB Output isn't correct
24 Incorrect 27 ms 1144 KB Output isn't correct
25 Incorrect 19 ms 1144 KB Output isn't correct
26 Incorrect 26 ms 1152 KB Output isn't correct
27 Incorrect 29 ms 1272 KB Output isn't correct
28 Incorrect 37 ms 1144 KB Output isn't correct
29 Incorrect 63 ms 1148 KB Output isn't correct
30 Incorrect 14 ms 1152 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 3 ms 384 KB Output isn't correct