#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
#define sz(s) (int)s.size()
ll findGap(int T, int n){
ll s = 0, t = 1e18, mn, mx;
MinMax(s, t, &mn, &mx);
ll d = ((mx - mn + 1) / (n - 1)), k = mn, ans = 0, m = mx;
for(ll i = mn; i + d < m; i += (d + 1)){
MinMax(i, i + d, &mn, &mx);
if(mx != -1){
ans = max(ans, mn-k);
k = mx;
}
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
12 ms |
600 KB |
Output isn't correct |
| 17 |
Incorrect |
10 ms |
660 KB |
Output isn't correct |
| 18 |
Incorrect |
10 ms |
616 KB |
Output isn't correct |
| 19 |
Incorrect |
10 ms |
600 KB |
Output isn't correct |
| 20 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
| 21 |
Incorrect |
34 ms |
2800 KB |
Output isn't correct |
| 22 |
Incorrect |
35 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
41 ms |
1204 KB |
Output isn't correct |
| 24 |
Incorrect |
37 ms |
1112 KB |
Output isn't correct |
| 25 |
Incorrect |
39 ms |
1112 KB |
Output isn't correct |
| 26 |
Incorrect |
42 ms |
1112 KB |
Output isn't correct |
| 27 |
Incorrect |
40 ms |
2648 KB |
Output isn't correct |
| 28 |
Incorrect |
36 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
38 ms |
2840 KB |
Output isn't correct |
| 30 |
Incorrect |
20 ms |
1236 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2484 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
2 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
10 ms |
648 KB |
Output is correct |
| 17 |
Correct |
8 ms |
600 KB |
Output is correct |
| 18 |
Correct |
12 ms |
600 KB |
Output is correct |
| 19 |
Correct |
8 ms |
600 KB |
Output is correct |
| 20 |
Correct |
5 ms |
600 KB |
Output is correct |
| 21 |
Correct |
37 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
34 ms |
2648 KB |
Output is correct |
| 23 |
Correct |
36 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 25 |
Correct |
28 ms |
2644 KB |
Output is correct |
| 26 |
Correct |
34 ms |
2648 KB |
Output is correct |
| 27 |
Correct |
41 ms |
1216 KB |
Output is correct |
| 28 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
36 ms |
1112 KB |
Output is correct |
| 30 |
Correct |
21 ms |
1112 KB |
Output is correct |
| 31 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
