#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(0,INF,&a1,&an);
int k = (an-a1+N-1)/(N-1); //N-1 differences between i and i+1
ll cur = a1,x,y,ans = k, last = a1;
while(cur+k-1 <= an){
MinMax(cur,cur+k-1,&x,&y);
if(x != -1){
ans = max(ans,x-last);
last = y;
}
cur += k-1;
}
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 |
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 |
0 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 |
0 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 |
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 |
2648 KB |
Output is correct |
17 |
Correct |
7 ms |
2648 KB |
Output is correct |
18 |
Correct |
7 ms |
2648 KB |
Output is correct |
19 |
Correct |
7 ms |
2648 KB |
Output is correct |
20 |
Correct |
7 ms |
2568 KB |
Output is correct |
21 |
Correct |
26 ms |
3476 KB |
Output is correct |
22 |
Correct |
25 ms |
3416 KB |
Output is correct |
23 |
Correct |
29 ms |
3416 KB |
Output is correct |
24 |
Correct |
25 ms |
3416 KB |
Output is correct |
25 |
Correct |
24 ms |
3628 KB |
Output is correct |
26 |
Correct |
26 ms |
3416 KB |
Output is correct |
27 |
Correct |
28 ms |
3416 KB |
Output is correct |
28 |
Correct |
26 ms |
3416 KB |
Output is correct |
29 |
Correct |
25 ms |
3416 KB |
Output is correct |
30 |
Correct |
22 ms |
3416 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 |
Execution timed out |
3057 ms |
2392 KB |
Time limit exceeded |
2 |
Runtime error |
1 ms |
2392 KB |
Execution failed because the return code was nonzero |
3 |
Runtime error |
0 ms |
2392 KB |
Execution failed because the return code was nonzero |
4 |
Runtime error |
0 ms |
2392 KB |
Execution failed because the return code was nonzero |
5 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
6 |
Execution timed out |
3096 ms |
2392 KB |
Time limit exceeded |
7 |
Execution timed out |
3039 ms |
2392 KB |
Time limit exceeded |
8 |
Execution timed out |
3078 ms |
2392 KB |
Time limit exceeded |
9 |
Execution timed out |
3045 ms |
2392 KB |
Time limit exceeded |
10 |
Correct |
1 ms |
2392 KB |
Output is correct |
11 |
Execution timed out |
3077 ms |
2392 KB |
Time limit exceeded |
12 |
Execution timed out |
3052 ms |
2644 KB |
Time limit exceeded |
13 |
Runtime error |
1 ms |
2392 KB |
Execution failed because the return code was nonzero |
14 |
Execution timed out |
3094 ms |
2392 KB |
Time limit exceeded |
15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
16 |
Execution timed out |
3086 ms |
2488 KB |
Time limit exceeded |
17 |
Runtime error |
4 ms |
2392 KB |
Execution failed because the return code was nonzero |
18 |
Execution timed out |
3049 ms |
2392 KB |
Time limit exceeded |
19 |
Execution timed out |
3076 ms |
2392 KB |
Time limit exceeded |
20 |
Partially correct |
6 ms |
2392 KB |
Partially correct |
21 |
Execution timed out |
3079 ms |
2640 KB |
Time limit exceeded |
22 |
Execution timed out |
3066 ms |
2648 KB |
Time limit exceeded |
23 |
Execution timed out |
3077 ms |
2648 KB |
Time limit exceeded |
24 |
Execution timed out |
3067 ms |
2648 KB |
Time limit exceeded |
25 |
Incorrect |
31 ms |
2648 KB |
Output isn't correct |
26 |
Execution timed out |
3038 ms |
2648 KB |
Time limit exceeded |
27 |
Execution timed out |
3045 ms |
2732 KB |
Time limit exceeded |
28 |
Execution timed out |
3048 ms |
2648 KB |
Time limit exceeded |
29 |
Execution timed out |
3061 ms |
2648 KB |
Time limit exceeded |
30 |
Partially correct |
22 ms |
2648 KB |
Partially correct |
31 |
Runtime error |
1 ms |
2392 KB |
Execution failed because the return code was nonzero |
32 |
Runtime error |
0 ms |
2392 KB |
Execution failed because the return code was nonzero |