Submission #1005955

# Submission time Handle Problem Language Result Execution time Memory
1005955 2024-06-23T08:57:34 Z vjudge1 Gap (APIO16_gap) C++17
89.0204 / 100
44 ms 3536 KB
#include<bits/stdc++.h>
#include "gap.h"
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int mxn=3e5+5;
/*multiset<ll>ms;
void MinMax(ll x,ll y,ll &x1,ll &y1){
    x1=*ms.lower_bound(x);
    y1=*prev(ms.upper_bound(y));
}*/
ll sol1(int n){
    ll mn=0,mx=1e18;
    int l=1,r=n;
    ll a[n+1];
    while(l<=r){
        ll s,t;
        MinMax(mn,mx,&s,&t);
        a[l++]=s;a[r--]=t;
        mn=s+1,mx=t-1;
    }ll ans=0;
    for(int i=2;i<=n;i++)ans=max(ans,a[i]-a[i-1]);
    return ans;
}
ll sol2(int n){
    ll mn=0,mx=1e18;
    ll s,t;MinMax(mn,mx,&s,&t);
    ll add = (t-s)/(n-1);
    ll ans=add;ll cs=s;
    while(s<t){
        ll cmn=cs,cmx=cs;
        ll tt=1;
        while(1){
            ll cl=cmn,cr=cmx;
            if(s+(tt-1)*add>t)break;
            MinMax(s+(tt-1)*add,s+tt*add,&cl,&cr);
            if(cl==-1&&cr==-1){tt++;continue;}
            cmn=cl,cmx=cr;break;
        }
        ans=max(ans,cmx-cmn);
        ans=max(ans,cmn-cs);
        s+=(tt)*add;cs=cmx;s=max(s,cmx);
        if(s==cmx)s++;
    }return ans;
}
long long findGap(int T, int N){
    if(T==1)return sol1(N);
    else return sol2(N);
}
/*int main(){
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        int x;cin>>x;ms.insert(x);
    }for(auto it : ms)cout<<it<<' ';cout<<'\n';
    cout<<findGap(2,n);
}*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2420 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 0 ms 2392 KB Output is correct
10 Correct 0 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 9 ms 2784 KB Output is correct
17 Correct 6 ms 2648 KB Output is correct
18 Correct 7 ms 2648 KB Output is correct
19 Correct 6 ms 2648 KB Output is correct
20 Correct 5 ms 2648 KB Output is correct
21 Correct 22 ms 3504 KB Output is correct
22 Correct 23 ms 3416 KB Output is correct
23 Correct 27 ms 3416 KB Output is correct
24 Correct 26 ms 3412 KB Output is correct
25 Correct 27 ms 3416 KB Output is correct
26 Correct 22 ms 3416 KB Output is correct
27 Correct 33 ms 3416 KB Output is correct
28 Correct 29 ms 3536 KB Output is correct
29 Correct 33 ms 3408 KB Output is correct
30 Correct 24 ms 3416 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 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Correct 1 ms 2392 KB Output is correct
6 Partially correct 0 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Correct 1 ms 2392 KB Output is correct
16 Partially correct 9 ms 2392 KB Partially correct
17 Partially correct 8 ms 2392 KB Partially correct
18 Partially correct 8 ms 2392 KB Partially correct
19 Partially correct 8 ms 2392 KB Partially correct
20 Partially correct 5 ms 2392 KB Partially correct
21 Partially correct 35 ms 2648 KB Partially correct
22 Partially correct 34 ms 2836 KB Partially correct
23 Partially correct 44 ms 2780 KB Partially correct
24 Partially correct 34 ms 2648 KB Partially correct
25 Correct 41 ms 2648 KB Output is correct
26 Partially correct 34 ms 2740 KB Partially correct
27 Partially correct 34 ms 2648 KB Partially correct
28 Partially correct 33 ms 2648 KB Partially correct
29 Partially correct 32 ms 2648 KB Partially correct
30 Partially correct 28 ms 2648 KB Partially correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct