#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 mn , mx ;
if(T == 1){
ll l = -1 , r = 1e18 + 1 ;
while(r - l > 1){
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
return 1 ;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
336 KB |
Output isn't correct |
| 16 |
Incorrect |
19 ms |
2168 KB |
Output isn't correct |
| 17 |
Incorrect |
17 ms |
2236 KB |
Output isn't correct |
| 18 |
Incorrect |
19 ms |
2252 KB |
Output isn't correct |
| 19 |
Incorrect |
17 ms |
2236 KB |
Output isn't correct |
| 20 |
Correct |
18 ms |
2260 KB |
Output is correct |
| 21 |
Incorrect |
91 ms |
8084 KB |
Output isn't correct |
| 22 |
Incorrect |
75 ms |
8092 KB |
Output isn't correct |
| 23 |
Incorrect |
89 ms |
8092 KB |
Output isn't correct |
| 24 |
Incorrect |
82 ms |
8088 KB |
Output isn't correct |
| 25 |
Incorrect |
75 ms |
8132 KB |
Output isn't correct |
| 26 |
Incorrect |
83 ms |
8020 KB |
Output isn't correct |
| 27 |
Incorrect |
78 ms |
8056 KB |
Output isn't correct |
| 28 |
Incorrect |
82 ms |
8032 KB |
Output isn't correct |
| 29 |
Incorrect |
77 ms |
8056 KB |
Output isn't correct |
| 30 |
Correct |
73 ms |
8052 KB |
Output is correct |
| 31 |
Correct |
0 ms |
208 KB |
Output is correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 16 |
Incorrect |
5 ms |
416 KB |
Output isn't correct |
| 17 |
Incorrect |
6 ms |
464 KB |
Output isn't correct |
| 18 |
Incorrect |
6 ms |
428 KB |
Output isn't correct |
| 19 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
| 20 |
Incorrect |
4 ms |
388 KB |
Output isn't correct |
| 21 |
Incorrect |
30 ms |
1048 KB |
Output isn't correct |
| 22 |
Incorrect |
20 ms |
1064 KB |
Output isn't correct |
| 23 |
Incorrect |
24 ms |
952 KB |
Output isn't correct |
| 24 |
Incorrect |
22 ms |
968 KB |
Output isn't correct |
| 25 |
Incorrect |
22 ms |
992 KB |
Output isn't correct |
| 26 |
Incorrect |
20 ms |
1004 KB |
Output isn't correct |
| 27 |
Incorrect |
20 ms |
1064 KB |
Output isn't correct |
| 28 |
Incorrect |
30 ms |
1060 KB |
Output isn't correct |
| 29 |
Incorrect |
21 ms |
996 KB |
Output isn't correct |
| 30 |
Incorrect |
12 ms |
1104 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
