#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int n){
ll mn,mx;
MinMax(1,1e18,&mn,&mx);
ll ans=(mx-mn+n-2)/(n-1);
for(ll l=mn,r=mx,p=mn;l+1<r;){
MinMax(l+1,min(l+ans,r),&mn,&mx);
l+=ans+1;
if(mn!=-1)ans=max(ans,mn-p),p=mx;
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2484 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2400 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
2392 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 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Correct |
5 ms |
2580 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2588 KB |
Output is correct |
| 18 |
Correct |
5 ms |
2576 KB |
Output is correct |
| 19 |
Correct |
5 ms |
2592 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2692 KB |
Output is correct |
| 21 |
Correct |
17 ms |
2860 KB |
Output is correct |
| 22 |
Correct |
17 ms |
3096 KB |
Output is correct |
| 23 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 24 |
Correct |
18 ms |
2856 KB |
Output is correct |
| 25 |
Incorrect |
42 ms |
2856 KB |
Output isn't correct |
| 26 |
Correct |
17 ms |
2668 KB |
Output is correct |
| 27 |
Correct |
24 ms |
3024 KB |
Output is correct |
| 28 |
Correct |
19 ms |
2676 KB |
Output is correct |
| 29 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
13 ms |
2848 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 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 |
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 |
5 ms |
2580 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2580 KB |
Output is correct |
| 18 |
Correct |
5 ms |
2588 KB |
Output is correct |
| 19 |
Correct |
5 ms |
2752 KB |
Output is correct |
| 20 |
Correct |
3 ms |
2568 KB |
Output is correct |
| 21 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 22 |
Correct |
17 ms |
2848 KB |
Output is correct |
| 23 |
Correct |
17 ms |
3104 KB |
Output is correct |
| 24 |
Correct |
17 ms |
2868 KB |
Output is correct |
| 25 |
Correct |
37 ms |
2840 KB |
Output is correct |
| 26 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 27 |
Correct |
18 ms |
2764 KB |
Output is correct |
| 28 |
Correct |
18 ms |
3020 KB |
Output is correct |
| 29 |
Correct |
17 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
17 ms |
2816 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
