Submission #849854

#TimeUsernameProblemLanguageResultExecution timeMemory
849854nninGap (APIO16_gap)C++14
30 / 100
43 ms3092 KiB
#include "gap.h"
#define ll long long
#include<bits/stdc++.h>
using namespace std;

long long findGap(int T, int N) {
    ll mn, mx, curmn, curmx;
    MinMax((ll)0, (ll)1e18, &mn, &mx);
    ll ans = 0;
    if(T==1) {
        while(N>2) {
            MinMax(mn+1, mx-1, &curmn, &curmx);
            ans = max(ans,  max(curmn-mn, mx-curmx));
            N -= 2;
            mx = curmx;
            mn = curmn;
        }
        ans = max(ans, mx-mn);
    } else {
        ll gap = ans = (mx-mn-1)/(N-1);
        ll rem = (mx-mn-1)%(N-1);
        ll last = mn;
        for(int i=1;i<N;i++) {
            MinMax(last+1, mn+gap+(i<=rem), &curmn, &curmx);
            if(curmn!=-1) {
                ans = max(ans, curmn-last);
                last = curmx;
            }
            mn += gap+(i<=rem);
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...