#include <bits/stdc++.h>
using namespace std;
int n;
typedef long long ll;
void MinMax(ll, ll, ll*, ll*);
ll ceil(ll x, ll d) {
return (x - 1) / d + 1;
}
ll solve_naive() {
ll l = 0, r = 1000000000000000000LL;
vector<ll> v;
int lim = (n + 1) / 2;
for(int i=1; i<=lim; i++) {
ll x, y;
MinMax(l, r, &x, &y);
v.push_back(x);
if(x != y) v.push_back(y);
l = x + 1;
r = y - 1;
}
sort(v.begin(), v.end());
ll ret = 0;
for(int i=1; i<(ll)v.size(); i++) {
ret = max(ret, v[i] - v[i-1]);
} return ret;
}
ll solve_proway() {
ll L = 0, R = 1e18;
MinMax(L, R, &L, &R);
if(n == 2) return R - L;
ll big = ceil(R - L - 1, (ll)n-2);
ll small = (R - L - 1) / (n - 2);
ll big_cnt = (R - L - 1) % (n-2);
ll small_cnt = (n - 2) - big_cnt;
vector<pair<ll, ll>> v;
ll nxt = L;
for(ll i=1, l = L+1; i<=big_cnt; i++, l += big) {
ll r = l + big - 1;
ll x, y;
MinMax(l, r, &x, &y);
if(x != -1) {
v.push_back(make_pair(x, y));
} nxt = r+1;
}
for(ll i = 1, l = nxt; i <= small_cnt; i++, l += small) {
ll r = l + small - 1;
ll x, y;
MinMax(l, r, &x, &y);
if(x != -1) {
v.push_back(make_pair(x, y));
}
}
int tot = 2;
for(pair<ll, ll> b : v) {
if(b.first == b.second) tot++;
else tot += 2;
}
if(tot == n) {
ll ret = 0;
ret = max(ret, v[0].first - L);
ret = max(ret, R - v.back().second);
for(int i=0; i<v.size(); i++) {
ret = max(ret, v[i].second - v[i].first);
}
for(int i=1; i<v.size(); i++) {
ret = max(ret, v[i].first - v[i-1].second);
}
return ret;
}
else {
ll ret = 0;
ret = max(ret, v[0].first - L);
ret = max(ret, R - v.back().second);
for(int i=0; i<v.size(); i++) {
ret = max(ret, v[i].first - v[i-1].second);
} return ret;
}
}
long long findGap(int32_t T, int32_t N)
{
n = N;
if(T == 1) return solve_naive();
else return solve_proway();
return 0;
}
Compilation message
gap.cpp: In function 'll solve_proway()':
gap.cpp:68:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<v.size(); i++) {
~^~~~~~~~~
gap.cpp:71:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v.size(); i++) {
~^~~~~~~~~
gap.cpp:80:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<v.size(); i++) {
~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
408 KB |
Output is correct |
| 4 |
Correct |
2 ms |
460 KB |
Output is correct |
| 5 |
Correct |
2 ms |
468 KB |
Output is correct |
| 6 |
Correct |
2 ms |
468 KB |
Output is correct |
| 7 |
Correct |
2 ms |
544 KB |
Output is correct |
| 8 |
Correct |
3 ms |
688 KB |
Output is correct |
| 9 |
Correct |
2 ms |
688 KB |
Output is correct |
| 10 |
Correct |
2 ms |
688 KB |
Output is correct |
| 11 |
Correct |
3 ms |
688 KB |
Output is correct |
| 12 |
Correct |
3 ms |
688 KB |
Output is correct |
| 13 |
Correct |
3 ms |
688 KB |
Output is correct |
| 14 |
Correct |
3 ms |
688 KB |
Output is correct |
| 15 |
Correct |
3 ms |
688 KB |
Output is correct |
| 16 |
Correct |
23 ms |
1128 KB |
Output is correct |
| 17 |
Correct |
23 ms |
1128 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1220 KB |
Output is correct |
| 19 |
Correct |
17 ms |
1220 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1256 KB |
Output is correct |
| 21 |
Correct |
67 ms |
2548 KB |
Output is correct |
| 22 |
Correct |
72 ms |
2548 KB |
Output is correct |
| 23 |
Correct |
94 ms |
2548 KB |
Output is correct |
| 24 |
Correct |
82 ms |
2548 KB |
Output is correct |
| 25 |
Correct |
53 ms |
2676 KB |
Output is correct |
| 26 |
Correct |
73 ms |
2676 KB |
Output is correct |
| 27 |
Correct |
60 ms |
2676 KB |
Output is correct |
| 28 |
Correct |
61 ms |
2676 KB |
Output is correct |
| 29 |
Correct |
59 ms |
2676 KB |
Output is correct |
| 30 |
Correct |
65 ms |
2676 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2676 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
2676 KB |
Output isn't correct |
| 4 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2676 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2676 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2676 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2676 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2676 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2676 KB |
Output is correct |
| 16 |
Correct |
20 ms |
2676 KB |
Output is correct |
| 17 |
Correct |
20 ms |
2676 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2676 KB |
Output is correct |
| 19 |
Correct |
21 ms |
2676 KB |
Output is correct |
| 20 |
Correct |
13 ms |
2676 KB |
Output is correct |
| 21 |
Correct |
75 ms |
2676 KB |
Output is correct |
| 22 |
Correct |
75 ms |
2676 KB |
Output is correct |
| 23 |
Correct |
87 ms |
2676 KB |
Output is correct |
| 24 |
Correct |
87 ms |
2676 KB |
Output is correct |
| 25 |
Correct |
71 ms |
3568 KB |
Output is correct |
| 26 |
Correct |
75 ms |
3568 KB |
Output is correct |
| 27 |
Correct |
75 ms |
3568 KB |
Output is correct |
| 28 |
Correct |
73 ms |
3568 KB |
Output is correct |
| 29 |
Correct |
74 ms |
3568 KB |
Output is correct |
| 30 |
Correct |
40 ms |
3568 KB |
Output is correct |
| 31 |
Correct |
2 ms |
3568 KB |
Output is correct |
| 32 |
Correct |
2 ms |
3568 KB |
Output is correct |
