# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
23399 |
2017-05-08T18:09:39 Z |
noobprogrammer |
Gap (APIO16_gap) |
C++14 |
|
93 ms |
5924 KB |
#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 ;
i++ ;
}
ll res = 0 ;
for(int i=1;i<n;i++) res = max(arr[i+1] - arr[i] , res) ;
return res ;
}
else{
ll mn , mx , len , seg , a , b ;
MinMax(0 , 1e18 , &mn , &mx ) ;
if(n == 2) return mx - mn ;
len = mx - mn + 1 ; seg = len/n ;
ll res = 0 , lst = mn ;
MinMax( mn+1 , mn + seg - 1 , &a , &b ) ;
if(a != -1) res = a - lst , lst = b ;
for(ll i=mn+seg ; i<mx ; i+=seg) {
MinMax( i+1 , min(i + seg - 1 , mx-1 ) , &a , &b ) ;
if(a > -1) res = max(res , a - lst) , lst = b ;
}
return res ;
}
}
# |
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 |
13 ms |
5924 KB |
Output is correct |
17 |
Correct |
13 ms |
5924 KB |
Output is correct |
18 |
Correct |
13 ms |
5924 KB |
Output is correct |
19 |
Correct |
13 ms |
5924 KB |
Output is correct |
20 |
Correct |
9 ms |
5924 KB |
Output is correct |
21 |
Correct |
46 ms |
5924 KB |
Output is correct |
22 |
Correct |
53 ms |
5924 KB |
Output is correct |
23 |
Correct |
59 ms |
5924 KB |
Output is correct |
24 |
Correct |
49 ms |
5924 KB |
Output is correct |
25 |
Correct |
43 ms |
5924 KB |
Output is correct |
26 |
Correct |
66 ms |
5924 KB |
Output is correct |
27 |
Correct |
46 ms |
5924 KB |
Output is correct |
28 |
Correct |
53 ms |
5924 KB |
Output is correct |
29 |
Correct |
46 ms |
5924 KB |
Output is correct |
30 |
Correct |
39 ms |
5924 KB |
Output is correct |
31 |
Correct |
0 ms |
5924 KB |
Output is correct |
32 |
Correct |
0 ms |
5924 KB |
Output is correct |
# |
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 |
16 ms |
5924 KB |
Output is correct |
17 |
Correct |
16 ms |
5924 KB |
Output is correct |
18 |
Correct |
13 ms |
5924 KB |
Output is correct |
19 |
Correct |
16 ms |
5924 KB |
Output is correct |
20 |
Correct |
6 ms |
5924 KB |
Output is correct |
21 |
Correct |
69 ms |
5924 KB |
Output is correct |
22 |
Correct |
69 ms |
5924 KB |
Output is correct |
23 |
Correct |
86 ms |
5924 KB |
Output is correct |
24 |
Correct |
69 ms |
5924 KB |
Output is correct |
25 |
Correct |
69 ms |
5924 KB |
Output is correct |
26 |
Correct |
69 ms |
5924 KB |
Output is correct |
27 |
Correct |
83 ms |
5924 KB |
Output is correct |
28 |
Correct |
93 ms |
5924 KB |
Output is correct |
29 |
Correct |
79 ms |
5924 KB |
Output is correct |
30 |
Correct |
43 ms |
5924 KB |
Output is correct |
31 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
32 |
Correct |
0 ms |
5924 KB |
Output is correct |