Submission #116630

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
116630	2019-06-13T09:12:32 Z	roseanne_pcy	Gap (APIO16_gap)	C++14	100 / 100	61 ms	3100 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;
			}
		}
		best = max(best, right-last);
	}
	return best;
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 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	2 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	2 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	13 ms	1024 KB	Output is correct
17	Correct	12 ms	1024 KB	Output is correct
18	Correct	13 ms	1024 KB	Output is correct
19	Correct	12 ms	1024 KB	Output is correct
20	Correct	9 ms	640 KB	Output is correct
21	Correct	45 ms	2916 KB	Output is correct
22	Correct	44 ms	2944 KB	Output is correct
23	Correct	45 ms	2936 KB	Output is correct
24	Correct	52 ms	2936 KB	Output is correct
25	Correct	38 ms	2304 KB	Output is correct
26	Correct	45 ms	2936 KB	Output is correct
27	Correct	44 ms	2936 KB	Output is correct
28	Correct	45 ms	3064 KB	Output is correct
29	Correct	45 ms	2944 KB	Output is correct
30	Correct	32 ms	1792 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct

Subtask #2

70.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 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	2 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	408 KB	Output is correct
16	Correct	16 ms	1024 KB	Output is correct
17	Correct	16 ms	1072 KB	Output is correct
18	Correct	16 ms	1024 KB	Output is correct
19	Correct	16 ms	1024 KB	Output is correct
20	Correct	8 ms	640 KB	Output is correct
21	Correct	61 ms	2996 KB	Output is correct
22	Correct	59 ms	3100 KB	Output is correct
23	Correct	59 ms	2944 KB	Output is correct
24	Correct	59 ms	3012 KB	Output is correct
25	Correct	55 ms	2304 KB	Output is correct
26	Correct	60 ms	2936 KB	Output is correct
27	Correct	59 ms	2936 KB	Output is correct
28	Correct	59 ms	3064 KB	Output is correct
29	Correct	59 ms	2936 KB	Output is correct
30	Correct	34 ms	1792 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct