Submission #30751

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
30751	2017-07-26T11:35:43 Z	kavun	Gap (APIO16_gap)	C++14	30 / 100	73 ms	5924 KB

gap

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll a[100010], mx;
int n, val;


long long findGap(int T, int N)
{
  n = N;
  val = n % 2 ? n/2+1 : n/2;
  if(T == 1)
    {
      MinMax(0,1e18,a,a + n-1);
      for(int i = 1; i < val; i++)
	MinMax(a[i-1]+1,a[n-i]-1,a + i,a + n-1-i);
    }
  for(int i = 0; i < n-1; i++)
    mx = max(mx,a[i+1]-a[i]);
  return mx;
}

Subtask #1

30.0 / 30.0

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

Subtask #2

0 / 70.0

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