Submission #23383

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
23383	2017-05-08T14:23:15 Z	noobprogrammer	Gap (APIO16_gap)	C++14	0 / 100	46 ms	5924 KB

gap

#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define ii pair<int,int>
#define vii vector<pair<int,int> >
#define vi vector<int>

ll arr[100010] ;

ll findGap(int t , int n){
	int sz = n ;
	if(t == 1){
		MinMax( 0 , 1e18 , arr + 1 , arr + n ) ;
		sz-=2 ;
		int  i = 1 ;
		while(sz > 0){
			MinMax( arr[i]+1 , arr[n-i+1]-1 , arr + i + 1 , arr + n - i  ) ;
			sz-=2 ;
		}
		ll res = 0 ;
		for(int i=1;i<n;i++) res = max(arr[i+1] - arr[i] , res) ;
		return res ;
	}
	else{

	}
	return 0 ;
}

Subtask #1

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	5924 KB	Output is 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	9 ms	5924 KB	Output isn't correct
17	Incorrect	9 ms	5924 KB	Output isn't correct
18	Incorrect	9 ms	5924 KB	Output isn't correct
19	Incorrect	6 ms	5924 KB	Output isn't correct
20	Incorrect	6 ms	5924 KB	Output isn't correct
21	Incorrect	26 ms	5924 KB	Output isn't correct
22	Incorrect	46 ms	5924 KB	Output isn't correct
23	Incorrect	36 ms	5924 KB	Output isn't correct
24	Incorrect	36 ms	5924 KB	Output isn't correct
25	Incorrect	19 ms	5924 KB	Output isn't correct
26	Incorrect	46 ms	5924 KB	Output isn't correct
27	Incorrect	46 ms	5924 KB	Output isn't correct
28	Incorrect	43 ms	5924 KB	Output isn't correct
29	Incorrect	36 ms	5924 KB	Output isn't correct
30	Incorrect	23 ms	5924 KB	Output isn't correct
31	Correct	0 ms	5924 KB	Output is correct
32	Incorrect	0 ms	5924 KB	Output isn't 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	9 ms	5924 KB	Output isn't correct
17	Incorrect	6 ms	5924 KB	Output isn't correct
18	Incorrect	9 ms	5924 KB	Output isn't correct
19	Incorrect	6 ms	5924 KB	Output isn't correct
20	Incorrect	6 ms	5924 KB	Output isn't correct
21	Incorrect	23 ms	5924 KB	Output isn't correct
22	Incorrect	26 ms	5924 KB	Output isn't correct
23	Incorrect	33 ms	5924 KB	Output isn't correct
24	Incorrect	29 ms	5924 KB	Output isn't correct
25	Incorrect	33 ms	5924 KB	Output isn't correct
26	Incorrect	39 ms	5924 KB	Output isn't correct
27	Incorrect	33 ms	5924 KB	Output isn't correct
28	Incorrect	26 ms	5924 KB	Output isn't correct
29	Incorrect	29 ms	5924 KB	Output isn't correct
30	Incorrect	23 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