#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;l+=ans){
MinMax(l+1,min(l+ans+1,r),&mn,&mx);
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 |
1 ms |
2392 KB |
Output isn't correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2392 KB |
Output is correct |
5 |
Incorrect |
1 ms |
2636 KB |
Output isn't 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 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2488 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 |
4 ms |
2588 KB |
Output is correct |
17 |
Correct |
7 ms |
2584 KB |
Output is correct |
18 |
Correct |
5 ms |
2588 KB |
Output is correct |
19 |
Correct |
6 ms |
2832 KB |
Output is correct |
20 |
Incorrect |
4 ms |
2392 KB |
Output isn't correct |
21 |
Correct |
17 ms |
2856 KB |
Output is correct |
22 |
Correct |
19 ms |
2868 KB |
Output is correct |
23 |
Correct |
20 ms |
2772 KB |
Output is correct |
24 |
Correct |
18 ms |
2864 KB |
Output is correct |
25 |
Incorrect |
39 ms |
2892 KB |
Output isn't correct |
26 |
Correct |
19 ms |
2828 KB |
Output is correct |
27 |
Correct |
19 ms |
2856 KB |
Output is correct |
28 |
Correct |
19 ms |
2868 KB |
Output is correct |
29 |
Correct |
18 ms |
3072 KB |
Output is correct |
30 |
Incorrect |
15 ms |
2828 KB |
Output isn't correct |
31 |
Correct |
0 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 |
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 |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
1 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 |
5 ms |
2580 KB |
Output is correct |
17 |
Correct |
6 ms |
2580 KB |
Output is correct |
18 |
Correct |
5 ms |
2584 KB |
Output is correct |
19 |
Correct |
5 ms |
2836 KB |
Output is correct |
20 |
Incorrect |
3 ms |
2568 KB |
Output isn't correct |
21 |
Correct |
17 ms |
2968 KB |
Output is correct |
22 |
Correct |
17 ms |
2860 KB |
Output is correct |
23 |
Correct |
16 ms |
2852 KB |
Output is correct |
24 |
Correct |
19 ms |
3124 KB |
Output is correct |
25 |
Correct |
36 ms |
2856 KB |
Output is correct |
26 |
Correct |
17 ms |
2864 KB |
Output is correct |
27 |
Correct |
17 ms |
2852 KB |
Output is correct |
28 |
Correct |
20 ms |
3108 KB |
Output is correct |
29 |
Correct |
22 ms |
2852 KB |
Output is correct |
30 |
Incorrect |
18 ms |
2864 KB |
Output isn't correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
0 ms |
2392 KB |
Output is correct |