Submission #1083361

#TimeUsernameProblemLanguageResultExecution timeMemory
1083361SeungniGap (APIO16_gap)C++17
59.02 / 100
45 ms1360 KiB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;
using ll = long long;
using pii = pair<int, int>;

ll ans[100005];

long long findGap(int T, int N) {
    
    ll l = 0, r = 1e18 + 500;
    
    ll mn, mx;
    MinMax(l, r, &mn, &mx);
    
    l = mn, r = mx;
    
    ll len = (r - 1) - (l + 1) + 1;
    
    if (N == 2) return r - l;
    
    ll b = len / N;
    if (len % N) b++;
    
    ll ret = 0;
    
    ll p = l;
    
    while (l < r) {
        MinMax(l, l + b, &mn, &mx);
        
        l += b;
        if (mn == -1 && mx == -1) continue;
        
        ret = max(ret, mn - p);
        ret = max(ret, mx - mn);
        p = mx;        
    }
    
    return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...