#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 d=(mx-mn)/n;
ll ans=(mx-mn+n-2)/(n-1);
for(ll l=mn,r=mx,p=mn;l+1<r;l+=d){
MinMax(l+1,min(l+d,r),&mn,&mx);
if(mn!=-1)ans=max(ans,mn-p),r=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 |
0 ms |
2392 KB |
Output isn't correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
15 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Incorrect |
4 ms |
2588 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
2752 KB |
Output isn't correct |
18 |
Incorrect |
3 ms |
2584 KB |
Output isn't correct |
19 |
Incorrect |
4 ms |
2836 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
2548 KB |
Output isn't correct |
21 |
Incorrect |
12 ms |
2988 KB |
Output isn't correct |
22 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
24 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
25 |
Correct |
9 ms |
2852 KB |
Output is correct |
26 |
Incorrect |
13 ms |
2824 KB |
Output isn't correct |
27 |
Incorrect |
12 ms |
3016 KB |
Output isn't correct |
28 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
29 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
30 |
Incorrect |
7 ms |
2856 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
15 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Incorrect |
3 ms |
2752 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
2584 KB |
Output isn't correct |
18 |
Incorrect |
3 ms |
2680 KB |
Output isn't correct |
19 |
Incorrect |
3 ms |
2580 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
2568 KB |
Output isn't correct |
21 |
Incorrect |
12 ms |
2852 KB |
Output isn't correct |
22 |
Incorrect |
13 ms |
2856 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
2852 KB |
Output isn't correct |
24 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
25 |
Correct |
9 ms |
2852 KB |
Output is correct |
26 |
Incorrect |
16 ms |
2836 KB |
Output isn't correct |
27 |
Incorrect |
12 ms |
2856 KB |
Output isn't correct |
28 |
Incorrect |
12 ms |
2668 KB |
Output isn't correct |
29 |
Incorrect |
15 ms |
3360 KB |
Output isn't correct |
30 |
Incorrect |
9 ms |
2860 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
32 |
Correct |
0 ms |
2392 KB |
Output is correct |