Submission #880080

# Submission time Handle Problem Language Result Execution time Memory
880080 2023-11-28T17:12:35 Z JakobZorz Gap (APIO16_gap) C++14
100 / 100
40 ms 4436 KB
#include"gap.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;

ll find_gap1(int n){
    vector<ll>vec1,vec2;
    ll l=0,r=1e18;
    while(true){
        MinMax(l,r,&l,&r);
        if(l==r){
            if(l!=-1)
                vec1.push_back(l);
            break;
        }
        vec1.push_back(l);
        vec2.push_back(r);
        l++;
        r--;
        if((int)vec1.size()+(int)vec2.size()==n)
            break;
    }
    reverse(vec2.begin(),vec2.end());
    vec1.insert(vec1.end(),vec2.begin(),vec2.end());
    ll res=0;
    for(int i=1;i<n;i++)
        res=max(res,vec1[i]-vec1[i-1]);
    return res;
}

ll find_gap2(int n){
    ll mn,mx;
    MinMax(0,1e18,&mn,&mx);
    ll gap=(mx-mn+n)/(n-1);
    ll last=mn;
    ll res=0;
    for(ll i=mn+1;i<mx;i+=gap+1){
        ll i1,i2;
        MinMax(i,i+gap,&i1,&i2);
        if(i1!=-1){
            res=max(res,i1-last);
            last=i2;
        }
    }
    
    return res;
}

ll findGap(int t,int n){
    if(t==1){
        return find_gap1(n);
    }else{
        return find_gap2(n);
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 3096 KB Output is correct
17 Correct 7 ms 3352 KB Output is correct
18 Correct 7 ms 3264 KB Output is correct
19 Correct 7 ms 3008 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 28 ms 4344 KB Output is correct
22 Correct 29 ms 4436 KB Output is correct
23 Correct 29 ms 4352 KB Output is correct
24 Correct 29 ms 4420 KB Output is correct
25 Correct 25 ms 4424 KB Output is correct
26 Correct 29 ms 4416 KB Output is correct
27 Correct 29 ms 4416 KB Output is correct
28 Correct 29 ms 4392 KB Output is correct
29 Correct 28 ms 4420 KB Output is correct
30 Correct 23 ms 4420 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 2752 KB Output is correct
17 Correct 10 ms 2572 KB Output is correct
18 Correct 10 ms 2588 KB Output is correct
19 Correct 10 ms 2752 KB Output is correct
20 Correct 5 ms 2572 KB Output is correct
21 Correct 39 ms 2852 KB Output is correct
22 Correct 39 ms 2852 KB Output is correct
23 Correct 39 ms 2860 KB Output is correct
24 Correct 38 ms 2856 KB Output is correct
25 Correct 36 ms 2844 KB Output is correct
26 Correct 39 ms 2852 KB Output is correct
27 Correct 39 ms 2860 KB Output is correct
28 Correct 40 ms 2856 KB Output is correct
29 Correct 39 ms 2852 KB Output is correct
30 Correct 20 ms 2852 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct