#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF = 1e18;
ll findGap(int T, int N){
if(T == 1){
ll l = 1, r = INF;
ll mn, mx;
vector<ll> arr(N);
int ind = 0;
for(int i = 1;i<=(N+1)/2;++i){
MinMax(l,r,&mn,&mx);
arr[ind] = mn;
arr[++ind] = mx;
++ind;
l = mn+1; r = mx-1;
}
sort(arr.begin(),arr.end());
ll ans = 0;
for(int i = 0;i<=arr.size()-1;++i){
ans = max(ans,arr[i+1]-arr[i]);
}
return ans;
}
ll a1, an;
MinMax(1,INF,&a1,&an);
ll k = (an-a1+N-2)/(N-1); //N-1 differences between i and i+1, I think the N-2 is so that we don't find an immediately?
ll cur = a1,x,y,ans = k, last = a1;
while(cur+k <= an){
MinMax(cur,cur+k,&x,&y); //x >= cur and y <= cur+k
if(x != -1){ //if there is such a x with x >= cur
ans = max(ans,x-last);
last = y; //last really just saves the last one where something was found?
}
cur += k+1;
}
/*MinMax(cur,an,&x,&y);
if(x != -1){
ans = max(ans,x-last);
}*/
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:21:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
21 | for(int i = 0;i<=arr.size()-1;++i){
| ~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2552 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
1 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 |
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 |
2 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
14 ms |
2648 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2648 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2648 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2648 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2648 KB |
Output is correct |
| 21 |
Correct |
37 ms |
3536 KB |
Output is correct |
| 22 |
Correct |
36 ms |
3416 KB |
Output is correct |
| 23 |
Correct |
32 ms |
3416 KB |
Output is correct |
| 24 |
Correct |
33 ms |
3416 KB |
Output is correct |
| 25 |
Correct |
28 ms |
3416 KB |
Output is correct |
| 26 |
Correct |
46 ms |
3416 KB |
Output is correct |
| 27 |
Correct |
32 ms |
3532 KB |
Output is correct |
| 28 |
Correct |
30 ms |
3416 KB |
Output is correct |
| 29 |
Correct |
32 ms |
3416 KB |
Output is correct |
| 30 |
Correct |
28 ms |
3480 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 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 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 |
0 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 |
Incorrect |
1 ms |
2388 KB |
Output isn't 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 |
8 ms |
2480 KB |
Output is correct |
| 17 |
Correct |
9 ms |
2392 KB |
Output is correct |
| 18 |
Correct |
9 ms |
2596 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2596 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2392 KB |
Output is correct |
| 21 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 22 |
Correct |
36 ms |
2648 KB |
Output is correct |
| 23 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 24 |
Correct |
34 ms |
2648 KB |
Output is correct |
| 25 |
Correct |
32 ms |
2648 KB |
Output is correct |
| 26 |
Correct |
35 ms |
2648 KB |
Output is correct |
| 27 |
Correct |
36 ms |
2648 KB |
Output is correct |
| 28 |
Correct |
34 ms |
2648 KB |
Output is correct |
| 29 |
Correct |
35 ms |
2784 KB |
Output is correct |
| 30 |
Correct |
20 ms |
2648 KB |
Output is correct |
| 31 |
Incorrect |
0 ms |
2388 KB |
Output isn't correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
