| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 231301 | peijar | Gap (APIO16_gap) | C++17 | 0 ms | 0 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>
using namespace std;
#define SZ(v) ((int)(v).size())
using ll = long long;
/*
En une requete on chope min/max
la reponse est au moins delta = ceil((max-min)/(n-1)) !
On demande ensuite tous les intervalles [min + k * delta, min + (k+1)delta]
Osef de ce qu'il y a au milieu
on s'interesse a
*/
ll MinMax(ll lo, ll up, ll &mn, ll &mx);
ll findGap(int sous_tache, int nb_elem)
{
ll smallest, biggest;
MinMax((ll)0, (ll)1e18, smallest, biggest);
ll delta = ceil( (long double)(biggest - smallest) / (nb_elem - 1));
vector<ll> sparse_elem;
for (ll k(0); k < nb_elem - 1; ++k)
{
ll l, r;
MinMax(smallest + k * delta, smallest + (k+1) * delta, l, r);
if (l != -1)
{
sparse_elem.push_back(l);
sparse_elem.push_back(r);
}
}
ll ans = delta;
for (int i(0); i + 1 < SZ(sparse_elem); ++i)
ans = max(ans, sparse_elem[i+1] - sparse_elem[i]);
return ans;
}