#include "gap.h"
using namespace std;
#define ll long long
#include <vector>
#define vll vector<ll>
#include <algorithm>
long long findGap(int T, int N)
{
if (T == 1) {
ll a = -1, b = 1e18 + 1;
vll v;
for (int it = 0; it < (N + 1) / 2; it++) {
auto *at = new ll, *bt = new ll;
MinMax(a + 1, b - 1, at, bt);
a = *at, b = *bt;
v.push_back(a); v.push_back(b);
}
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < v.size() - 1; i++)if(v[i]>-1)ans = max(ans, v[i + 1] - v[i]);
return ans;
}
else {
auto* a = new ll, * b = new ll;
MinMax(0, 1e18, a, b);
vll v;
ll d = ((* b) - (* a) + N - 2) / (N - 1);
for (ll i = *a; i < *b; i += d + 1) {
auto *c = new ll, * k = new ll;
MinMax(i, i+d, c, k);
v.push_back((ll)*c); v.push_back((ll) * k);
}
sort(v.begin(), v.end());
ll ans = d;
for (int i = 0; i+1 < v.size(); i++) {
if (v[i] > -1) {
ans = max(ans, v[i + 1] - v[i]);
}
}
return ans;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:20:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | for (int i = 0; i < v.size() - 1; i++)if(v[i]>-1)ans = max(ans, v[i + 1] - v[i]);
| ~~^~~~~~~~~~~~~~
gap.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
35 | for (int i = 0; i+1 < v.size(); i++) {
| ~~~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2480 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
3468 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3456 KB |
Output is correct |
| 18 |
Correct |
9 ms |
3644 KB |
Output is correct |
| 19 |
Correct |
9 ms |
3460 KB |
Output is correct |
| 20 |
Correct |
8 ms |
3456 KB |
Output is correct |
| 21 |
Correct |
34 ms |
6556 KB |
Output is correct |
| 22 |
Correct |
34 ms |
6676 KB |
Output is correct |
| 23 |
Correct |
38 ms |
6752 KB |
Output is correct |
| 24 |
Correct |
34 ms |
6808 KB |
Output is correct |
| 25 |
Correct |
30 ms |
6788 KB |
Output is correct |
| 26 |
Correct |
33 ms |
6560 KB |
Output is correct |
| 27 |
Correct |
34 ms |
6532 KB |
Output is correct |
| 28 |
Correct |
34 ms |
7088 KB |
Output is correct |
| 29 |
Correct |
33 ms |
6564 KB |
Output is correct |
| 30 |
Correct |
32 ms |
6568 KB |
Output is correct |
| 31 |
Incorrect |
1 ms |
2404 KB |
Output isn't correct |
| 32 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
12 ms |
4484 KB |
Output is correct |
| 17 |
Correct |
13 ms |
4664 KB |
Output is correct |
| 18 |
Correct |
12 ms |
4472 KB |
Output is correct |
| 19 |
Correct |
12 ms |
4488 KB |
Output is correct |
| 20 |
Correct |
7 ms |
4472 KB |
Output is correct |
| 21 |
Correct |
51 ms |
10640 KB |
Output is correct |
| 22 |
Correct |
50 ms |
10652 KB |
Output is correct |
| 23 |
Correct |
51 ms |
10640 KB |
Output is correct |
| 24 |
Correct |
51 ms |
10504 KB |
Output is correct |
| 25 |
Correct |
45 ms |
10556 KB |
Output is correct |
| 26 |
Correct |
51 ms |
10668 KB |
Output is correct |
| 27 |
Correct |
51 ms |
10640 KB |
Output is correct |
| 28 |
Correct |
51 ms |
10648 KB |
Output is correct |
| 29 |
Correct |
51 ms |
10660 KB |
Output is correct |
| 30 |
Correct |
28 ms |
9616 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2480 KB |
Output is correct |
