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 "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N){
long long mn, mx, ans = -((long long)1E18 + 7);
vector<long long> a(N+1, 0ll);
MinMax(0ll, (long long)1E18, &mn, &mx);
a[1] = mn, a[N] = mx;
if(T == 1 || N <= 10){
for(register int i = 2; i <= N/2 + (N & 1); ++i){
long long l = a[i-1], r = a[N - (i-1) + 1];
MinMax(l+1, r-1, &mn, &mx); // called by reference
a[i] = mn, a[N - i + 1] = mx;
}
for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
return ans;
}
long long blo = (mx - mn + N - 2) / (N - 1);
long long pmx{a[1]};
for(long long j = a[1]; j <= a[N] + blo; j += blo){
MinMax(j, j + blo - 1, &mn, &mx);
if(mn == -1) continue;
ans = max(ans, mn - pmx);
pmx = mx;
}
return ans;
}
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:17:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
17 | for(register int i = 2; i <= N/2 + (N & 1); ++i){
| ^
gap.cpp:27:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
27 | for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |