#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int N)
{
ll l = 0;
ll r = 10e18;
vector<ll> left, right;
int calls = (N + 1) / 2;
ll mn, mx;
for(int j = 1; j <= calls; j ++)
{
MinMax(l, r, &mn, &mx);
if(mn != mx)
{
right.push_back(mx);
}
left.push_back(mn);
l = mn + 1;
r = mx - 1;
}
ll mxdif = 0;
for(int i = 0; i <((int)left.size() - 1); i ++)
{
mxdif = max(mxdif, left[i + 1] - left[i]);
}
for(int i = right.size() - 1; i >=1; i --)
{
mxdif = max(mxdif, right[i-1] - right[i]);
}
/*
for(auto val:left)
{
cout<< val <<" " ;
}
cout << '\n';
for(auto val:right)
{
cout<< val <<" " ;
}*/
int s= left.size();
int u = right.size();
mxdif=max(mxdif, right[u-1] - left[s-1]);
return mxdif;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:9:9: warning: overflow in conversion from 'double' to 'll' {aka 'long long int'} changes value from '1.0e+19' to '9223372036854775807' [-Woverflow]
9 | ll r = 10e18;
| ^~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 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 |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 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 |
7 ms |
2744 KB |
Output is correct |
| 17 |
Correct |
7 ms |
2904 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2740 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2904 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2904 KB |
Output is correct |
| 21 |
Correct |
30 ms |
3616 KB |
Output is correct |
| 22 |
Correct |
26 ms |
3716 KB |
Output is correct |
| 23 |
Correct |
34 ms |
3716 KB |
Output is correct |
| 24 |
Correct |
26 ms |
3708 KB |
Output is correct |
| 25 |
Correct |
23 ms |
3712 KB |
Output is correct |
| 26 |
Correct |
26 ms |
3716 KB |
Output is correct |
| 27 |
Correct |
26 ms |
3716 KB |
Output is correct |
| 28 |
Correct |
28 ms |
3716 KB |
Output is correct |
| 29 |
Correct |
27 ms |
3708 KB |
Output is correct |
| 30 |
Correct |
26 ms |
3708 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
2484 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
2396 KB |
Partially correct |
| 16 |
Partially correct |
6 ms |
2904 KB |
Partially correct |
| 17 |
Partially correct |
9 ms |
2720 KB |
Partially correct |
| 18 |
Partially correct |
7 ms |
2720 KB |
Partially correct |
| 19 |
Partially correct |
8 ms |
2740 KB |
Partially correct |
| 20 |
Partially correct |
7 ms |
2904 KB |
Partially correct |
| 21 |
Incorrect |
25 ms |
3708 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
27 ms |
3716 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
33 ms |
3708 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
27 ms |
3716 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
30 ms |
3712 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
27 ms |
3968 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
26 ms |
3708 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
26 ms |
3708 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
26 ms |
3712 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
21 ms |
3716 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
