Submission #560943

# Submission time Handle Problem Language Result Execution time Memory
560943 2022-05-12T05:33:44 Z karrigan Gap (APIO16_gap) C++14
30 / 100
52 ms 1864 KB
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);
#include "gap.h"
using namespace std;
const int maxn=1e6;
using ll=long long int;
long long a[100009];
long long findGap(int t, int n){
    if (t==1){
        a[0]=-1;
        a[n+1]=2e18;
        for (int i=1,j=n;i<=j;i++,j--){
            MinMax(a[i-1]+1, a[j+1]-1, &a[i], &a[j]);
        }
        long long ans=-1;
        for (int i=2;i<=n;i++){
            ans=max(ans,a[i]-a[i-1]);
        }
        return ans;
    }
    else {
        MinMax(0,1e18,&a[1],&a[n]);
        long long l,r;
        MinMax(a[1],a[1]+(a[n]-a[1])/(n-1),&l,&r);
        long long temp=(a[n]-a[1])/(n-1);
        long long ans=r-l;
        for (long long ret=r+1;ret<a[n];ret+=temp+1){
            long long mn,mx;
            MinMax(ret,ret+temp,&mn,&mx);
            ans=max(ans,mn-r);
            r=mx;
        }
        return ans;
    }
}
 
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 10 ms 624 KB Output is correct
17 Correct 9 ms 592 KB Output is correct
18 Correct 10 ms 592 KB Output is correct
19 Correct 10 ms 660 KB Output is correct
20 Correct 9 ms 592 KB Output is correct
21 Correct 38 ms 1832 KB Output is correct
22 Correct 36 ms 1832 KB Output is correct
23 Correct 44 ms 1832 KB Output is correct
24 Correct 38 ms 1832 KB Output is correct
25 Correct 32 ms 1864 KB Output is correct
26 Correct 38 ms 1788 KB Output is correct
27 Correct 40 ms 1756 KB Output is correct
28 Correct 38 ms 1820 KB Output is correct
29 Correct 43 ms 1780 KB Output is correct
30 Correct 30 ms 1828 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Correct 0 ms 208 KB Output is correct
6 Incorrect 1 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Incorrect 0 ms 208 KB Output isn't correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 336 KB Output isn't correct
15 Correct 1 ms 336 KB Output is correct
16 Incorrect 13 ms 524 KB Output isn't correct
17 Incorrect 12 ms 464 KB Output isn't correct
18 Incorrect 12 ms 432 KB Output isn't correct
19 Incorrect 14 ms 520 KB Output isn't correct
20 Incorrect 6 ms 464 KB Output isn't correct
21 Incorrect 51 ms 1020 KB Output isn't correct
22 Incorrect 50 ms 1096 KB Output isn't correct
23 Incorrect 49 ms 1064 KB Output isn't correct
24 Incorrect 50 ms 1092 KB Output isn't correct
25 Correct 46 ms 1088 KB Output is correct
26 Incorrect 52 ms 968 KB Output isn't correct
27 Incorrect 49 ms 1092 KB Output isn't correct
28 Incorrect 52 ms 1088 KB Output isn't correct
29 Incorrect 50 ms 1064 KB Output isn't correct
30 Incorrect 28 ms 1072 KB Output isn't correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct