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;
typedef long long ll;
long long findGap(int T, int N) {
if(1) {
ll pmn, pmx, mn, mx, ret = 0;
MinMax(0, (ll)1e18+10, &pmn, &pmx);
for(int i=1; i<(N+1)/2; i++) {
MinMax(pmn+1, pmx-1, &mn, &mx);
ret = max(ret, mn - pmn);
ret = max(ret, pmx - mx);
pmn = mn, pmx = mx;
} ret = max(ret, pmx - pmn);
return ret;
} else { return 10;}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |