Submission #32339

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
32339	2017-10-09T13:37:23 Z	WhipppedCream	Gap (APIO16_gap)	C++14	30 / 100	86 ms	5140 KB

gap

#include <bits/stdc++.h>
#ifdef atom
#include "grader.cpp"
#else
#include "gap.h"
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
long long findGap(int T, int n)
{
	ll left, right;
	MinMax(0, 1e18, &left, &right);
	ll best = 0;
	if(T == 1)
	{
		ll lmin = left, lmax = right;
		for(int i = 2; i< n; i+= 2)
		{
			ll mmin, mmax;
			MinMax(lmin+1, lmax-1, &mmin, &mmax);
			best = max(best, mmin-lmin);
			best = max(best, lmax-mmax);
			lmin = mmin;
			lmax = mmax;
		}
		best = max(best, lmax-lmin);
	}
	else
	{
		ll last = left;
		ll sz = (right-left+n-1)/n;
		for(ll s = left+1, e = left+sz, i = 0; i< n; s+= sz, e+=sz)
		{
			if(e>= right) e = right-1;
			if(s> e) break;
			ll mmin, mmax;
			MinMax(s, e, &mmin, &mmax);
			if(mmin != -1)
			{
				best = max(best, mmin-last);
				last = mmax;
			}
		}
	}
	return best;
}

Subtask #1

30.0 / 30.0

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

Subtask #2

0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	5140 KB	Output isn't correct
2	Correct	0 ms	5140 KB	Output is correct
3	Correct	0 ms	5140 KB	Output is correct
4	Correct	0 ms	5140 KB	Output is correct
5	Correct	0 ms	5140 KB	Output is correct
6	Correct	0 ms	5140 KB	Output is correct
7	Correct	0 ms	5140 KB	Output is correct
8	Correct	0 ms	5140 KB	Output is correct
9	Correct	0 ms	5140 KB	Output is correct
10	Correct	0 ms	5140 KB	Output is correct
11	Correct	0 ms	5140 KB	Output is correct
12	Correct	0 ms	5140 KB	Output is correct
13	Correct	0 ms	5140 KB	Output is correct
14	Correct	0 ms	5140 KB	Output is correct
15	Correct	0 ms	5140 KB	Output is correct
16	Correct	19 ms	5140 KB	Output is correct
17	Correct	19 ms	5140 KB	Output is correct
18	Correct	19 ms	5140 KB	Output is correct
19	Correct	16 ms	5140 KB	Output is correct
20	Correct	6 ms	5140 KB	Output is correct
21	Correct	69 ms	5140 KB	Output is correct
22	Correct	86 ms	5140 KB	Output is correct
23	Correct	76 ms	5140 KB	Output is correct
24	Correct	73 ms	5140 KB	Output is correct
25	Correct	63 ms	5140 KB	Output is correct
26	Correct	86 ms	5140 KB	Output is correct
27	Correct	73 ms	5140 KB	Output is correct
28	Correct	69 ms	5140 KB	Output is correct
29	Correct	76 ms	5140 KB	Output is correct
30	Correct	36 ms	5140 KB	Output is correct
31	Incorrect	0 ms	5140 KB	Output isn't correct
32	Correct	0 ms	5140 KB	Output is correct