# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206189 | mraron | Gap (APIO16_gap) | C++14 | 117 ms | 11836 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"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<ll> res;
void solve(ll L, ll R) {
if(L>R) return ;
ll a,b;
MinMax(L,R,&a,&b);
if(a==-1) return ;
res.insert(a);
res.insert(b);
solve(a+1,(a/b)/2);
solve((a/b)/2+1, b-1);
}
long long findGap(int T, int N)
{
solve(0, 1000000000000000000LL);
vector<ll> ans;
for(auto i:res) ans.push_back(i);
ll val=1000000000000000000LL;
for(int i=1;i<ans.size();++i) val=min(val, ans[i]-ans[i-1]);
return val;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |