#include "gap.h"
#include <bits/stdc++.h>
#define endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
if(y == 0) return 1 ;
if(y == 1) return x ;
ll ret = mypower(x , y / 2);
ret = (ret * ret) % mod;
if(y % 2) ret = ( ret * x ) % mod ;
return ret ;
}
map < ll , ll > mp ;
vector < ll > v ;
long long findGap(int T, int N)
{
ll n = N ;
ll mn = -1, mx = 1e18 ;
if(T == 1){
ll l = -1 , r = 1e18 + 1 ;
while(v.size() != N){
MinMax(l , r , &mn , &mx) ;
if(mn == -1 && mx == -1){
break ;
}
if(mp.count(mn) == 0){
mp[mn] = 1 ;
v.push_back(mn) ;
l = mn + 1 ;
}
if(mp.count(mx) == 0){
mp[mx] = 1 ;
v.push_back(mx) ;
r = mx - 1;
}
}
sort(v.begin() , v.end()) ;
ll ans = 0 ;
for(int i = 1 ; i < N ; i++){
ans = max(ans , v[i] - v[i - 1]) ;
}
return ans ;
}
else{
MinMax(mn , mx , &mn , &mx) ;
ll len = (mx - mn + 1) / (n - 1) ;
ll q = mn ;
ll ans = 0 ;
ll la = mx ;
for(int i = mn + 1 ; i <= la ; i += len + 1){
MinMax(i , i + len , &mn , &mx) ;
if(mn != -1){
ans = max(ans , mn - q) ;
q = mx ;
}
}
return ans ;
}
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:26:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
26 | while(v.size() != N){
| ~~~~~~~~~^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
1 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
404 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
29 ms |
2264 KB |
Output is correct |
| 17 |
Correct |
19 ms |
2252 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2188 KB |
Output is correct |
| 19 |
Correct |
19 ms |
2216 KB |
Output is correct |
| 20 |
Correct |
17 ms |
2252 KB |
Output is correct |
| 21 |
Correct |
101 ms |
8108 KB |
Output is correct |
| 22 |
Correct |
105 ms |
8084 KB |
Output is correct |
| 23 |
Correct |
89 ms |
8124 KB |
Output is correct |
| 24 |
Correct |
97 ms |
8128 KB |
Output is correct |
| 25 |
Correct |
77 ms |
8116 KB |
Output is correct |
| 26 |
Correct |
104 ms |
8040 KB |
Output is correct |
| 27 |
Correct |
86 ms |
8120 KB |
Output is correct |
| 28 |
Correct |
108 ms |
8088 KB |
Output is correct |
| 29 |
Correct |
84 ms |
8100 KB |
Output is correct |
| 30 |
Correct |
83 ms |
8084 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
1 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
3074 ms |
220 KB |
Time limit exceeded |
| 2 |
Execution timed out |
3077 ms |
256 KB |
Time limit exceeded |
| 3 |
Execution timed out |
3038 ms |
208 KB |
Time limit exceeded |
| 4 |
Execution timed out |
3074 ms |
208 KB |
Time limit exceeded |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Execution timed out |
3028 ms |
208 KB |
Time limit exceeded |
| 7 |
Execution timed out |
3064 ms |
256 KB |
Time limit exceeded |
| 8 |
Execution timed out |
3053 ms |
256 KB |
Time limit exceeded |
| 9 |
Execution timed out |
3070 ms |
208 KB |
Time limit exceeded |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Execution timed out |
3061 ms |
208 KB |
Time limit exceeded |
| 12 |
Execution timed out |
3053 ms |
384 KB |
Time limit exceeded |
| 13 |
Execution timed out |
3070 ms |
208 KB |
Time limit exceeded |
| 14 |
Execution timed out |
3059 ms |
208 KB |
Time limit exceeded |
| 15 |
Execution timed out |
3091 ms |
208 KB |
Time limit exceeded |
| 16 |
Execution timed out |
3046 ms |
464 KB |
Time limit exceeded |
| 17 |
Execution timed out |
3083 ms |
508 KB |
Time limit exceeded |
| 18 |
Execution timed out |
3082 ms |
484 KB |
Time limit exceeded |
| 19 |
Execution timed out |
3093 ms |
492 KB |
Time limit exceeded |
| 20 |
Correct |
7 ms |
464 KB |
Output is correct |
| 21 |
Execution timed out |
3014 ms |
1104 KB |
Time limit exceeded |
| 22 |
Execution timed out |
3042 ms |
996 KB |
Time limit exceeded |
| 23 |
Execution timed out |
3042 ms |
992 KB |
Time limit exceeded |
| 24 |
Execution timed out |
3047 ms |
1064 KB |
Time limit exceeded |
| 25 |
Execution timed out |
3059 ms |
976 KB |
Time limit exceeded |
| 26 |
Execution timed out |
3065 ms |
968 KB |
Time limit exceeded |
| 27 |
Execution timed out |
3060 ms |
968 KB |
Time limit exceeded |
| 28 |
Execution timed out |
3039 ms |
1056 KB |
Time limit exceeded |
| 29 |
Execution timed out |
3098 ms |
1124 KB |
Time limit exceeded |
| 30 |
Correct |
44 ms |
1080 KB |
Output is correct |
| 31 |
Execution timed out |
3052 ms |
208 KB |
Time limit exceeded |
| 32 |
Execution timed out |
3065 ms |
208 KB |
Time limit exceeded |
