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 v[100002];
long long findGap(int T, int N)
{
long long ans = 0;
int a = 1;
int b = N;
long long st = 0;
long long dr = 1;
for(int i = 1; i <= 18; ++i)
dr = dr * 10LL;
if(T == 1)
{
while(a <= b)
{
long long st2;
long long dr2;
if(a == 1)
MinMax(st, dr, &st2, &dr2);
else
MinMax(st+1, dr-1, &st2, &dr2);
v[a] = st2;
v[b] = dr2;
++a;
--b;
st = st2;
dr = dr2;
}
for(int i = 1; i < N; ++i)
ans = max(ans, v[i+1] - v[i]);
}
else
{
long long st2;
long long dr2;
MinMax(st, dr, &st2, &dr2);
st = st2;
dr = dr2;
long long max_val = dr;
ans = (dr - st) / (N - 1);
while(st <= max_val)
{
long long st2;
long long dr2;
dr = min(max_val, st + ans);
while(1)
{
MinMax(st, dr, &st2, &dr2);
if(dr2 == st)
dr = min(max_val, dr + ans);
else
{
ans = max(ans, dr2 - st);
st = dr2;
break;
}
}
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |