#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long B[100005];
long long findGap(int T, int N)
{
if(T == 1){
long long ans = 0, mini, maxi;
B[N+1] = (long long)1e18 + 5, B[0] = -1;
int j = N;
for(int i=1;i<=j;i++){
//cout << B[i-1] << " " << B[j+1] << '\n';
MinMax(B[i-1]+1, B[j+1]-1, &mini, &maxi);
//cout << mini << '\n';
B[i] = mini, B[j] = maxi;
//cout << *mini << " " << *maxi << '\n';
j--;
}
for(int i=1;i<N;i++)ans = max(ans, B[i+1] - B[i]);
return ans;
}
else{
long long ans = 0, mini, maxi;
MinMax(0, (long long)1e18, &mini, &maxi);
long long tmp = maxi - mini - 1;
if(N == 2)return maxi-mini;
long long prev = mini, prev2 = mini;
for(int i=1;i<=N-1;i++){
long long x = tmp/(N-i);
tmp -= x;
MinMax(prev2 + 1, prev2 + x, &mini, &maxi);
//cout << prev2 + 1 << " " << prev2 + x << " " << mini << " " << maxi << '\n';
if(mini != -1)ans = max(ans, mini - prev), prev = maxi;
prev2 += x;
}
return ans;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
1 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 |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
2 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 |
10 ms |
592 KB |
Output is correct |
| 17 |
Correct |
10 ms |
620 KB |
Output is correct |
| 18 |
Correct |
10 ms |
656 KB |
Output is correct |
| 19 |
Correct |
10 ms |
720 KB |
Output is correct |
| 20 |
Correct |
8 ms |
592 KB |
Output is correct |
| 21 |
Correct |
40 ms |
1836 KB |
Output is correct |
| 22 |
Correct |
40 ms |
1864 KB |
Output is correct |
| 23 |
Correct |
39 ms |
1736 KB |
Output is correct |
| 24 |
Correct |
41 ms |
1784 KB |
Output is correct |
| 25 |
Correct |
33 ms |
1864 KB |
Output is correct |
| 26 |
Correct |
42 ms |
1764 KB |
Output is correct |
| 27 |
Correct |
39 ms |
1780 KB |
Output is correct |
| 28 |
Correct |
42 ms |
1828 KB |
Output is correct |
| 29 |
Correct |
41 ms |
1832 KB |
Output is correct |
| 30 |
Correct |
31 ms |
1824 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 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 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 |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
0 ms |
208 KB |
Output is correct |
| 10 |
Correct |
0 ms |
208 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
15 ms |
436 KB |
Output is correct |
| 17 |
Correct |
14 ms |
520 KB |
Output is correct |
| 18 |
Correct |
14 ms |
496 KB |
Output is correct |
| 19 |
Correct |
13 ms |
464 KB |
Output is correct |
| 20 |
Correct |
6 ms |
464 KB |
Output is correct |
| 21 |
Correct |
59 ms |
1056 KB |
Output is correct |
| 22 |
Correct |
69 ms |
1064 KB |
Output is correct |
| 23 |
Correct |
57 ms |
1104 KB |
Output is correct |
| 24 |
Correct |
56 ms |
1060 KB |
Output is correct |
| 25 |
Correct |
50 ms |
1060 KB |
Output is correct |
| 26 |
Correct |
54 ms |
1080 KB |
Output is correct |
| 27 |
Correct |
59 ms |
1060 KB |
Output is correct |
| 28 |
Correct |
54 ms |
1052 KB |
Output is correct |
| 29 |
Correct |
56 ms |
1008 KB |
Output is correct |
| 30 |
Correct |
35 ms |
972 KB |
Output is correct |
| 31 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
| 32 |
Correct |
0 ms |
208 KB |
Output is correct |
