Submission #108022

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
108022	2019-04-26T22:32:03 Z	luciocf	Gap (APIO16_gap)	C++14	0 / 100	69 ms	3600 KB

gap

#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 (a[l]+1 > a[r]-1) break;

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

			if (mn == -1 || mx == -1) break;

			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;
}

Subtask #1

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	256 KB	Output isn't 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	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	Correct	3 ms	384 KB	Output is correct
11	Incorrect	4 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	3 ms	384 KB	Output isn't correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Incorrect	13 ms	1024 KB	Output isn't correct
17	Incorrect	16 ms	1024 KB	Output isn't correct
18	Incorrect	13 ms	1024 KB	Output isn't correct
19	Incorrect	14 ms	1024 KB	Output isn't correct
20	Correct	10 ms	768 KB	Output is correct
21	Incorrect	50 ms	3576 KB	Output isn't correct
22	Incorrect	47 ms	3580 KB	Output isn't correct
23	Incorrect	48 ms	3568 KB	Output isn't correct
24	Incorrect	53 ms	3548 KB	Output isn't correct
25	Incorrect	52 ms	2920 KB	Output isn't correct
26	Incorrect	69 ms	3576 KB	Output isn't correct
27	Incorrect	50 ms	3576 KB	Output isn't correct
28	Incorrect	54 ms	3600 KB	Output isn't correct
29	Incorrect	68 ms	3576 KB	Output isn't correct
30	Correct	47 ms	2424 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct

Subtask #2

0 / 70.0

#	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	2 ms	384 KB	Output isn't correct
6	Incorrect	3 ms	384 KB	Output isn't correct
7	Incorrect	2 ms	384 KB	Output isn't correct
8	Incorrect	3 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	3 ms	384 KB	Output isn't correct
12	Incorrect	3 ms	384 KB	Output isn't correct
13	Incorrect	2 ms	384 KB	Output isn't correct
14	Incorrect	3 ms	384 KB	Output isn't correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Incorrect	9 ms	768 KB	Output isn't correct
17	Incorrect	12 ms	896 KB	Output isn't correct
18	Incorrect	8 ms	768 KB	Output isn't correct
19	Incorrect	9 ms	896 KB	Output isn't correct
20	Incorrect	5 ms	512 KB	Output isn't correct
21	Incorrect	32 ms	2808 KB	Output isn't correct
22	Incorrect	33 ms	2812 KB	Output isn't correct
23	Incorrect	44 ms	2808 KB	Output isn't correct
24	Incorrect	33 ms	2808 KB	Output isn't correct
25	Incorrect	24 ms	2176 KB	Output isn't correct
26	Incorrect	30 ms	2808 KB	Output isn't correct
27	Incorrect	49 ms	2812 KB	Output isn't correct
28	Incorrect	31 ms	2808 KB	Output isn't correct
29	Incorrect	33 ms	2808 KB	Output isn't correct
30	Incorrect	18 ms	1664 KB	Output isn't correct
31	Incorrect	3 ms	384 KB	Output isn't correct
32	Incorrect	3 ms	384 KB	Output isn't correct