#include "gap.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll findGap(int t, int n) {
// cerr << t << ' ' << n << '\n';
ll l = 0, r = 1e18;
if(t == 1) {
set<ll> elem;
n = (n + 1) / 2;
for(int i = 0; i < n; i++) {
MinMax(l, r, &l, &r);
elem.insert(l);
elem.insert(r);
l++;
r--;
}
auto it = elem.begin();
it++;
ll mx = - 1;
for(auto i = next(it); i != elem.end(); i++)
mx = max(mx, *it - *prev(it));
return mx;
}
MinMax(l, r, &l, &r);
ll mx = r;
vector<pii> v;
ll minl = (r - l + n - 2) / (n - 1);
v.emplace_back(l, l);
// cerr << l << ' ' << r << ' ' << minl << '\n';
for(ll i = l; i < mx; i += minl) {
// cerr << i << ' ' << i + minl << ' ' << mx << '\n';
MinMax(i, min(mx, i + minl) - 1, &l, &r);
if(l == -1)
continue;
v.emplace_back(l, r);
}
v.emplace_back(mx, mx);
mx = -1;
for(int i = 1; i < v.size(); i++)
mx = max(v[i].first - v[i - 1].second, mx);
return mx;
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for(int i = 1; i < v.size(); i++)
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
208 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Incorrect |
15 ms |
1616 KB |
Output isn't correct |
| 17 |
Incorrect |
13 ms |
1660 KB |
Output isn't correct |
| 18 |
Incorrect |
14 ms |
1688 KB |
Output isn't correct |
| 19 |
Incorrect |
17 ms |
1628 KB |
Output isn't correct |
| 20 |
Incorrect |
13 ms |
1616 KB |
Output isn't correct |
| 21 |
Incorrect |
62 ms |
5784 KB |
Output isn't correct |
| 22 |
Incorrect |
57 ms |
5744 KB |
Output isn't correct |
| 23 |
Incorrect |
64 ms |
5688 KB |
Output isn't correct |
| 24 |
Incorrect |
56 ms |
5664 KB |
Output isn't correct |
| 25 |
Correct |
52 ms |
5780 KB |
Output is correct |
| 26 |
Incorrect |
65 ms |
5832 KB |
Output isn't correct |
| 27 |
Incorrect |
70 ms |
5772 KB |
Output isn't correct |
| 28 |
Incorrect |
57 ms |
5672 KB |
Output isn't correct |
| 29 |
Incorrect |
57 ms |
5820 KB |
Output isn't correct |
| 30 |
Incorrect |
52 ms |
5704 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
12 ms |
892 KB |
Output is correct |
| 17 |
Correct |
14 ms |
880 KB |
Output is correct |
| 18 |
Correct |
13 ms |
892 KB |
Output is correct |
| 19 |
Correct |
13 ms |
840 KB |
Output is correct |
| 20 |
Correct |
7 ms |
464 KB |
Output is correct |
| 21 |
Correct |
53 ms |
2204 KB |
Output is correct |
| 22 |
Correct |
61 ms |
2140 KB |
Output is correct |
| 23 |
Correct |
59 ms |
2168 KB |
Output is correct |
| 24 |
Correct |
53 ms |
2200 KB |
Output is correct |
| 25 |
Correct |
56 ms |
3228 KB |
Output is correct |
| 26 |
Correct |
55 ms |
2160 KB |
Output is correct |
| 27 |
Correct |
58 ms |
2232 KB |
Output is correct |
| 28 |
Correct |
53 ms |
2204 KB |
Output is correct |
| 29 |
Correct |
57 ms |
2216 KB |
Output is correct |
| 30 |
Correct |
28 ms |
1444 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
1 ms |
208 KB |
Output is correct |
