Submission #32332

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
32332	2017-10-09T13:11:33 Z	WhipppedCream	Gap (APIO16_gap)	C++14	0 / 100	63 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 = 0; i< n; i+= 2)
		{
			ll mmin, mmax;
			if(lmin+1> lmax-1) break;
			MinMax(lmin+1, lmax-1, &mmin, &mmax);
			if(mmin == -1) break;
			best = max(best, lmax-mmax);
			best = max(best, mmin-lmin);
			lmin = mmin; lmax = mmax;
		}
		best = max(best, lmax-lmin);
	}
	return best;
	return 0;
}

Subtask #1

0 / 30.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	Incorrect	0 ms	5140 KB	Output isn't correct
7	Incorrect	0 ms	5140 KB	Output isn't correct
8	Incorrect	0 ms	5140 KB	Output isn't correct
9	Incorrect	0 ms	5140 KB	Output isn't correct
10	Correct	0 ms	5140 KB	Output is correct
11	Incorrect	0 ms	5140 KB	Output isn't correct
12	Incorrect	0 ms	5140 KB	Output isn't correct
13	Incorrect	0 ms	5140 KB	Output isn't correct
14	Incorrect	0 ms	5140 KB	Output isn't correct
15	Incorrect	0 ms	5140 KB	Output isn't correct
16	Incorrect	13 ms	5140 KB	Output isn't correct
17	Incorrect	13 ms	5140 KB	Output isn't correct
18	Incorrect	13 ms	5140 KB	Output isn't correct
19	Incorrect	13 ms	5140 KB	Output isn't correct
20	Correct	9 ms	5140 KB	Output is correct
21	Incorrect	53 ms	5140 KB	Output isn't correct
22	Incorrect	49 ms	5140 KB	Output isn't correct
23	Incorrect	63 ms	5140 KB	Output isn't correct
24	Incorrect	63 ms	5140 KB	Output isn't correct
25	Incorrect	46 ms	5140 KB	Output isn't correct
26	Incorrect	56 ms	5140 KB	Output isn't correct
27	Incorrect	59 ms	5140 KB	Output isn't correct
28	Incorrect	59 ms	5140 KB	Output isn't correct
29	Incorrect	59 ms	5140 KB	Output isn't correct
30	Correct	36 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	Incorrect	0 ms	5140 KB	Output isn't correct
3	Incorrect	0 ms	5140 KB	Output isn't correct
4	Incorrect	0 ms	5140 KB	Output isn't correct
5	Incorrect	0 ms	5140 KB	Output isn't correct
6	Incorrect	0 ms	5140 KB	Output isn't correct
7	Incorrect	0 ms	5140 KB	Output isn't correct
8	Incorrect	0 ms	5140 KB	Output isn't correct
9	Incorrect	0 ms	5140 KB	Output isn't correct
10	Incorrect	0 ms	5140 KB	Output isn't correct
11	Incorrect	0 ms	5140 KB	Output isn't correct
12	Incorrect	0 ms	5140 KB	Output isn't correct
13	Incorrect	0 ms	5140 KB	Output isn't correct
14	Incorrect	0 ms	5140 KB	Output isn't correct
15	Incorrect	0 ms	5140 KB	Output isn't correct
16	Incorrect	6 ms	5140 KB	Output isn't correct
17	Incorrect	9 ms	5140 KB	Output isn't correct
18	Incorrect	13 ms	5140 KB	Output isn't correct
19	Incorrect	13 ms	5140 KB	Output isn't correct
20	Incorrect	3 ms	5140 KB	Output isn't correct
21	Incorrect	36 ms	5140 KB	Output isn't correct
22	Incorrect	33 ms	5140 KB	Output isn't correct
23	Incorrect	26 ms	5140 KB	Output isn't correct
24	Incorrect	43 ms	5140 KB	Output isn't correct
25	Incorrect	43 ms	5140 KB	Output isn't correct
26	Incorrect	26 ms	5140 KB	Output isn't correct
27	Incorrect	19 ms	5140 KB	Output isn't correct
28	Incorrect	33 ms	5140 KB	Output isn't correct
29	Incorrect	26 ms	5140 KB	Output isn't correct
30	Incorrect	13 ms	5140 KB	Output isn't correct
31	Incorrect	0 ms	5140 KB	Output isn't correct
32	Incorrect	0 ms	5140 KB	Output isn't correct