| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 366220 | mathking1021 | Gap (APIO16_gap) | C++17 | 67 ms | 3296 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 <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll t, n;
vector<ll> ve;
long long findGap(int T, int N)
{
t = T;
n = N;
ll a, b;
MinMax(0LL, (ll)2e18, &a, &b);
ll c = (b - a + n - 2) / (n - 1);
ll ans = c;
ve.push_back(a);
for(ll i = a + 1; i <= b - 1; i += c)
{
ll t3 = -1, t4 = -1;
MinMax(i, min(i + c - 1, b - 1), &t3, &t4);
if(t3 != -1)
{
ve.push_back(t3);
ve.push_back(t4);
}
}
ve.push_back(b);
for(ll i = 1; i < ve.size(); i++)
{
ans = max(ans, ve[i] - ve[i - 1]);
}
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
