| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1050379 | otarius | 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 "gap.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
void open_file(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 5 * 1e5 + 5;
ll findGap(int t, int n) {
if (t == 1) {
vector<ll> arr;
ll l = 1, r = 1e18, mn, mx;
for (int i = 1; i <= (n + 1) / 2; i++) {
MinMax(l, r, &mn, &mx);
arr.pb(mn); arr.pb(mx);
l = mn + 1; r = mx - 1;
} sort(all(arr));
mx = 0;
for (int i = 1; i < arr.size(); i++) {
mx = max(mx, arr[i] - arr[i - 1]);
} return mx;
} else {
ll mn, mx;
MinMax(1, 1e18, mn, mx);
// mn + (n - 1) * cnt = mx
// cnt = (mx - mn) / (n - 1);
ll cnt = (mx - mn) / (n - 1) + ((mx - mn) % (n - 1) > 0), lst = mn, ans = cnt, i;
for (i = mn; i + cnt <= mx; i += cnt + 1) {
MinMax(i, i + cnt, mn, mx);
if (mn != -1) {
ans = max(ans, mn - lst);
lst = mx;
}
} return ans;
}
}