| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 668241 | birthdaycake | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits.stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N){
long long l = 0, r = 0, mn = 0, mx = 0;
MinMax(1, 1000000000000000000, mn, mx);
l = mn; r = mx;
long long sz = (r - l + 1) / (N - 1);
vector<pair<int,int>>d;
for(int j = l; j <= r; j += sz+1){
MinMax(j, j + sz, mn, mx);
d.push_back({mn, mz});
}
long long ans = (r - l + 1) / (N - 1);
mn = d[0].first; mx = d[0].second;
for(int i = 1; i < d.size(); i++){
if(mx != -1 && d[i].first != -1){
ans = max(ans, d[i].first - mx);
mn = d[i].first;
mx = d[i].second;
}
}
return ans;
}