Submission #1027500

#TimeUsernameProblemLanguageResultExecution timeMemory
1027500KasymKGap (APIO16_gap)C++17
0 / 100
41 ms3532 KiB
#include "bits/stdc++.h"
#include "gap.h"
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define ll long long

ll findGap(int t, int n){
    ll answer = 0;
    if(t == 1){
        ll l = 1, r = 1e18, id = 0, mn, mx;
        vector<ll> a;
        a.resize(n+5);
        for(int i = 0; i < (n+1)/2; ++i){
            MinMax(l, r, &mn, &mx);
            a[id++] = mn;
            a[id++] = mx;
            l = mn+1, r = mx-1;
        }
        sort(all(a));
        for(int i = 0; i < n-1; ++i)
            answer = max(answer, a[i+1]-a[i]);
        return answer;
    }
    return answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...