| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 796428 | TheSahib | Gap (APIO16_gap) | C++14 | 42 ms | 2228 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>
#define ll long long
#define pii pair<int, int>
using namespace std;
const ll MAX = 1000000000000000000ll;
ll findGap(int T, int N)
{
if(T == 1){
ll l = 0, r = MAX;
vector<ll> v;
while(l <= r && v.size() < N){
ll mn, mx;
MinMax(l, r, &mn, &mx);
v.push_back(mn);
v.push_back(mx);
l = mn + 1;
r = mx - 1;
}
sort(v.begin(), v.end());
ll ans = 1;
for (int i = 1; i < v.size(); i++)
{
ans = max(ans, v[i] - v[i - 1]);
}
return ans;
}
ll mn, mx;
MinMax(0, MAX, &mn, &mx);
ll ans = (mx - mn + 1) / N;
ll p = mn;
while(p < mx){
if(p + ans >= mx) break;
ll l = 0, h = 0;
ll dist = ans + 1;
while(true){
MinMax(p + 1, p + dist, &l, &h);
if(l == -1){
dist *= 2;
continue;
}
ans = max(ans, l - p);
p = h;
break;
}
}
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
