Submission #125334

#TimeUsernameProblemLanguageResultExecution timeMemory
125334kjp4155Gap (APIO16_gap)C++17
0 / 100
29 ms1168 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll MX = 1e18;
ll A[500500];

ll findGap1(int N){
    int L=1, R=N;
    int mn = 0, mx = MX;
    while( L <= R ){
        ll a,b;
        MinMax(mn, mx, &a, &b);
        A[L++] = a; A[R--] = b;
        mn = a + 1; mx = b-1;
    }

    ll ans = 0;
    for(int i=1;i<N;i++) ans = max(ans, A[i+1]-A[i]);

    return ans;
}

ll findGap2(int N){
    return -1;
}

long long findGap(int T, int N){
    if( T == 1 ) return findGap1(N);
    else return findGap2(N);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...