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;
#define ll long long
#define sz(s) (int)s.size()
ll findGap(int T, int n){
ll s = 0, t = 1e18, mn, mx;
MinMax(s, t, &mn, &mx);
ll d = ((mx - mn + 1) / (n - 1)), k = mn, ans = 0, m = mx;
for(ll i = mn; i + d < m; i += (d + 1)){
MinMax(i, i + d, &mn, &mx);
if(mx != -1){
ans = max(ans, mn-k);
k = mx;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |