Submission #718095

#TimeUsernameProblemLanguageResultExecution timeMemory
718095irmuunGap (APIO16_gap)C++17
30 / 100
47 ms2248 KiB
#include<bits/stdc++.h>
#include "gap.h"

using namespace std;

#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

const ll INF=1e18;

ll findGap(int T,int N){
    vector<ll>v;
    ll l=0;
    ll r=INF;
    for(int i=1;i<=(N+1)/2;i++){
        ll a,b;
        MinMax(l,r,&a,&b);
        v.pb(a);
        if(a!=b){
            v.pb(b);
        }
        l=a+1;
        r=b-1;
    }
    sort(all(v));
    ll ans=v[1]-v[0];
    for(int i=2;i<N;i++){
        ans=max(ans,v[i]-v[i-1]);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...