| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 282637 | AaronNaidu | Gap (APIO16_gap) | C++14 | 108 ms | 6260 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 <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll mn = 0;
ll mx = 0;
ll n;
vector<ll> v;
unordered_map<ll, bool> taken;
/*void MinMax(ll left, ll right, ll *mn, ll *mx) {
ll x, y;
cin >> x >> y;
*mn = x;
*mx = y;
}*/
void binSearch(ll left, ll right) {
if (v.size() == n)
{
return;
}
if (right < left)
{
return;
}
MinMax(left, right, &mn, &mx);
if (mn == -1)
{
return;
}
if (taken.find(mn) == taken.end())
{
taken.insert({mn, true});
v.push_back(mn);
}
if (taken.find(mx) == taken.end())
{
taken.insert({mx, true});
v.push_back(mx);
}
if (mn == mx or mn == mx -1)
{
return;
}
left = mn+1;
right = mx-1;
ll med = (left+right)/2;
binSearch(left, med);
binSearch(med+1, right);
}
ll findGap(int t, int N) {
n = N;
ll leftPointer = 0;
ll rightPointer = 1000000000000000000;
if (t == 1)
{
while (v.size() < n)
{
MinMax(leftPointer, rightPointer, &mn, &mx);
v.push_back(mn);
v.push_back(mx);
leftPointer = mn+1;
rightPointer = mx-1;
}
sort(v.begin(), v.end());
ll maxDiff = 0;
for (int i = 0; i < v.size()-1; i++)
{
maxDiff = max(maxDiff, v[i+1]-v[i]);
}
return maxDiff;
}
binSearch(leftPointer, rightPointer);
sort(v.begin(), v.end());
ll maxDiff = 0;
for (int i = 0; i < v.size()-1; i++)
{
maxDiff = max(maxDiff, v[i+1]-v[i]);
}
return maxDiff;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
