#include "bits/stdc++.h"
#include "gap.h"
using namespace std;
const int sz = 1e5 + 5;
long long a[sz];
long long findGap(int T, int N) {if (1 == T) {
long long mn, mx;
MinMax(0, 1e18, &mn, &mx);
a[1] = mn;
a[N] = mx;
for (int i = 1; i <= (N+1)/2-1; i ++) {
MinMax(mn+1, mx-1, &mn, &mx);
a[i+1] = mn;
a[N - i] = mx;
}
long long gp = 0;
for (int i = 1; i <= N-1; i ++)
gp = max(gp, a[i+1] - a[i]);
return gp;
}
if (T == 2) {
long long mn, mx;
MinMax(0, 1e18, &mn, &mx);
vector<long long> b = {mn, mx};
long long k = (mx - mn + N - 2) / (N - 1);
while (b.size() < N) {
long long nextMin, nextMax;
// We should adjust the range for MinMax to ensure that we cover all possible values
if (b.size() == 2) {
// Special case for the first split, handling the entire range
MinMax(mn + 1, mx - 1, &nextMin, &nextMax);
} else {
long long rangeStart = mn + k;
long long rangeEnd = min(mx - 1, mn + k + k);
if (rangeStart > rangeEnd) break;
MinMax(rangeStart, rangeEnd, &nextMin, &nextMax);
}
// If no values found in the range, advance to the next block
if (nextMin == -1) {
mn = mx + 1;
continue;
}
// Adding found min and max
b.push_back(nextMin);
if (nextMax != nextMin) {
b.push_back(nextMax);
}
// Update the pointers
mn = nextMax + 1;
}
// Sorting the elements to find the maximum gap
sort(begin(b), end(b));
long long maxGap = 0;
for (int i = 0; i < b.size() - 1; i++) {
maxGap = max(maxGap, b[i + 1] - b[i]);
}
return maxGap;
}
return 0; // This part should never be reached for T = 2
}
/*#include "bits/stdc++.h"
#include "gap.h"
using namespace std;
const int sz = 1e5 + 5;
long long a[sz];
long long findGap(int T, int N)
{
if (1 == T) {
long long mn, mx;
MinMax(0, 1e18, &mn, &mx);
a[1] = mn;
a[N] = mx;
for (int i = 1; i <= (N+1)/2-1; i ++) {
MinMax(mn+1, mx-1, &mn, &mx);
a[i+1] = mn;
a[N - i] = mx;
}
long long gp = 0;
for (int i = 1; i <= N-1; i ++)
gp = max(gp, a[i+1] - a[i]);
return gp;
} else {
long long mn, mx;
MinMax(0, 1e18, &mn, &mx);
vector<long long> b = {mn, mx};
long long k = (mx - mn + N-2) / (N-1);
while (N != (int) b.size()) {
long long d = mn + k;
int s = mn+1;
int e = min(b[1]-1, mn + k+1);
if (s > e) break;
MinMax(s, e, &mn, &mx);
if (-1 == mn) {
mx = d;
continue;
} else if (mn == mx)
b.push_back(mn);
else {
b.push_back(mn);
b.push_back(mx);
while (N != (int) b.size()) {
if (mn+1>mx-1) break;
MinMax(mn+1, mx-1, &mn, &mx);
if (-1 == mn) break;
if (mn == mx) {
b.push_back(mn);
break;
} else {
b.push_back(mn);
b.push_back(mx);
}
}
mx = d;
}
mn = mx + 1;
}
//for (int x : b)
// cout << x << ' ';
// cout << '\n';
sort(begin(b), end(b));
long long gp = 0;
for (int i = 0; i < N-1; i ++)
gp = max(gp, b[i+1] - b[i]);
return gp;
}
return 0;
}*/
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
34 | while (b.size() < N) {
| ~~~~~~~~~^~~
gap.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for (int i = 0; i < b.size() - 1; i++) {
| ~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
460 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
7 ms |
600 KB |
Output is correct |
| 17 |
Correct |
9 ms |
600 KB |
Output is correct |
| 18 |
Correct |
7 ms |
600 KB |
Output is correct |
| 19 |
Correct |
7 ms |
800 KB |
Output is correct |
| 20 |
Correct |
6 ms |
600 KB |
Output is correct |
| 21 |
Correct |
26 ms |
1856 KB |
Output is correct |
| 22 |
Correct |
38 ms |
2000 KB |
Output is correct |
| 23 |
Correct |
26 ms |
1876 KB |
Output is correct |
| 24 |
Correct |
26 ms |
1872 KB |
Output is correct |
| 25 |
Correct |
24 ms |
1916 KB |
Output is correct |
| 26 |
Correct |
26 ms |
1804 KB |
Output is correct |
| 27 |
Correct |
26 ms |
1872 KB |
Output is correct |
| 28 |
Correct |
26 ms |
1872 KB |
Output is correct |
| 29 |
Correct |
26 ms |
1880 KB |
Output is correct |
| 30 |
Correct |
21 ms |
1880 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 17 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 18 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
| 19 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 20 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
| 21 |
Incorrect |
12 ms |
1160 KB |
Output isn't correct |
| 22 |
Incorrect |
13 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 24 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 25 |
Incorrect |
10 ms |
1112 KB |
Output isn't correct |
| 26 |
Incorrect |
12 ms |
1224 KB |
Output isn't correct |
| 27 |
Incorrect |
13 ms |
1112 KB |
Output isn't correct |
| 28 |
Incorrect |
14 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
| 30 |
Incorrect |
8 ms |
1212 KB |
Output isn't correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
1 ms |
344 KB |
Output is correct |
