# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
96034 | | lyc | Gap (APIO16_gap) | C++14 | | 63 ms | 4452 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 ans = 0;
ll s, t, mn, mx;
if (T == 1) {
s = 0, t = (ll)1e18;
ll arr[N];
for (int i = 0; i < (N+1)/2; ++i) {
MinMax(s, t, &mn, &mx);
arr[i] = mn;
arr[N-1-i] = mx;
s = mn+1;
t = mx-1;
//cout << "FOUND " << mn << " " << mx << '\n';
}
//for (int i = 0; i < N; ++i) cout << arr[i] << ' ' ;cout << endl;
for (int i = 1; i < N; ++i) {
ans = max(ans, arr[i]-arr[i-1]);
}
}
else {
s = 0, t = (ll)1e18;
vector<ll> v;
MinMax(s, t, &mn, &mx);
s = mn, t = mx;
v.push_back(s);
ll mingap = (mx-mn+N-2)/(N-1);
for (ll x = s+1; x < t; x = x+mingap+1) {
MinMax(x, x+mingap, &mn, &mx);
//cout << "CALL " << x << " " << x+mingap << ":: " << mn << " " << mx << endl;
if (mn != -1) {
v.push_back(mn);
v.push_back(mx);
}
}
v.push_back(t);
//for (auto x : v) cout << x << ' ' ; cout << endl;
for (int i = 1; i < v.size(); ++i) {
ans = max(ans, v[i]-v[i-1]);
}
}
return ans;
}
Compilation message (stderr)
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < v.size(); ++i) {
~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |