# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
849844 | | nnin | Gap (APIO16_gap) | C++14 | | 3099 ms | 3060 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 "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 {
int gap = ans = (mx-mn)/(N-1);
int cur = 0;
for(mn;mn<=mx;mn+=gap) {
MinMax(mn+1, mn+gap, &curmn, &curmx);
if(curmn==-1) {
cur += gap;
} else {
ans = max(ans, cur+curmn-mn);
cur = mn+gap-curmx;
}
}
}
return ans;
}
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:22:13: warning: statement has no effect [-Wunused-value]
22 | for(mn;mn<=mx;mn+=gap) {
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |