Submission #24972

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
24972	2017-06-19T12:55:41 Z	gabrielsimoes	Gap (APIO16_gap)	C++14	64.8778 / 100	76 ms	4900 KB

gap

#include "gap.h"
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll MIN = 0, MAX = 1000000000000000000;

void MM(ll a, ll b, ll *c, ll *d) {
	// printf("MinMax of %lld %lld\n", a, b);
	MinMax(a, b, c, d);
}

ll solve1(int n) {
	ll v[n+1];
	int i = 1, k = n;
	ll mn = MIN, mx = MAX;
	while (i <= k) {
		MinMax(mn, mx, v+i, v+k);
		mn = v[i++]+1;
		mx = v[k--]-1;
	}

	ll ret = 1;
	for (int i = 1; i < n; i++)
		ret = max(ret, v[i+1] - v[i]);
	return ret;
}

ll solve2(int n) {
	ll cur, lim;
	MM(MIN, MAX, &cur, &lim);
	ll ans = 1, test, l, r;
	while (cur < lim) {
		test = ans + 2;
		do {
			MM(cur+1, cur+test, &l, &r);
			test = test*2;
		} while (l == -1);
		ans = max(ans, l - cur);
		cur = r;
	}
	return ans;
}

ll findGap(int t, int n)
{
	return (t == 1 || n <= 8) ? solve1(n) : solve2(n);
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	4240 KB	Output is correct
2	Correct	0 ms	4240 KB	Output is correct
3	Correct	0 ms	4240 KB	Output is correct
4	Correct	0 ms	4240 KB	Output is correct
5	Correct	0 ms	4240 KB	Output is correct
6	Correct	0 ms	4240 KB	Output is correct
7	Correct	0 ms	4240 KB	Output is correct
8	Correct	0 ms	4240 KB	Output is correct
9	Correct	0 ms	4240 KB	Output is correct
10	Correct	0 ms	4240 KB	Output is correct
11	Correct	0 ms	4240 KB	Output is correct
12	Correct	0 ms	4240 KB	Output is correct
13	Correct	0 ms	4240 KB	Output is correct
14	Correct	0 ms	4240 KB	Output is correct
15	Correct	0 ms	4240 KB	Output is correct
16	Correct	16 ms	4312 KB	Output is correct
17	Correct	13 ms	4308 KB	Output is correct
18	Correct	13 ms	4308 KB	Output is correct
19	Correct	16 ms	4312 KB	Output is correct
20	Correct	9 ms	4312 KB	Output is correct
21	Correct	49 ms	4896 KB	Output is correct
22	Correct	59 ms	4900 KB	Output is correct
23	Correct	59 ms	4896 KB	Output is correct
24	Correct	69 ms	4892 KB	Output is correct
25	Correct	39 ms	4896 KB	Output is correct
26	Correct	76 ms	4892 KB	Output is correct
27	Correct	56 ms	4900 KB	Output is correct
28	Correct	56 ms	4892 KB	Output is correct
29	Correct	49 ms	4900 KB	Output is correct
30	Correct	39 ms	4896 KB	Output is correct
31	Correct	0 ms	4240 KB	Output is correct
32	Correct	0 ms	4240 KB	Output is correct

Subtask #2

34.8777572039 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	4240 KB	Output is correct
2	Partially correct	0 ms	4240 KB	Partially correct
3	Partially correct	0 ms	4240 KB	Partially correct
4	Partially correct	0 ms	4240 KB	Partially correct
5	Partially correct	0 ms	4240 KB	Partially correct
6	Correct	0 ms	4240 KB	Output is correct
7	Correct	0 ms	4240 KB	Output is correct
8	Correct	0 ms	4240 KB	Output is correct
9	Correct	0 ms	4240 KB	Output is correct
10	Correct	0 ms	4240 KB	Output is correct
11	Correct	0 ms	4240 KB	Output is correct
12	Correct	0 ms	4240 KB	Output is correct
13	Correct	0 ms	4240 KB	Output is correct
14	Correct	0 ms	4240 KB	Output is correct
15	Partially correct	0 ms	4240 KB	Partially correct
16	Correct	13 ms	4240 KB	Output is correct
17	Correct	6 ms	4240 KB	Output is correct
18	Correct	9 ms	4240 KB	Output is correct
19	Correct	9 ms	4240 KB	Output is correct
20	Correct	3 ms	4240 KB	Output is correct
21	Correct	33 ms	4240 KB	Output is correct
22	Correct	43 ms	4240 KB	Output is correct
23	Correct	43 ms	4240 KB	Output is correct
24	Correct	36 ms	4240 KB	Output is correct
25	Partially correct	63 ms	4240 KB	Partially correct
26	Correct	43 ms	4240 KB	Output is correct
27	Correct	33 ms	4240 KB	Output is correct
28	Correct	43 ms	4240 KB	Output is correct
29	Correct	33 ms	4240 KB	Output is correct
30	Correct	23 ms	4240 KB	Output is correct
31	Partially correct	0 ms	4240 KB	Partially correct
32	Correct	0 ms	4240 KB	Output is correct