| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 668299 | danikoynov | Gap (APIO16_gap) | C++14 | 48 ms | 2436 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;
long long findGap(int T, int N)
{
ll lf = 0, rf = 1e18, mn, mx;
MinMax(lf, rf, &mn, &mx);
vector < ll > vec;
while(true)
{
if (N == 0)
break;
if (N == 1)
{
MinMax(lf, rf, &mn, &mx);
vec.push_back(mn);
break;
}
N -= 2;
MinMax(lf, rf, &mn, &mx);
vec.push_back(mn);
vec.push_back(mx);
lf = mn + 1;
rf = mx - 1;
}
ll ans = 0;
sort(vec.begin(), vec.end());
for (int i = 1; i < vec.size(); i ++)
ans = max(ans, vec[i] - vec[i - 1]);
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
