#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
pair <i64,i64> qry(i64 s, i64 t){
i64 mn, mx;
MinMax(s, t, &mn, &mx);
return {mn, mx};
}
long long findGap(int T, int n){
auto [mn, mx] = qry(0, (i64)1e18);
i64 lb = (mx - mn) / (n - 1), opt = lb;
i64 pv = mn, j = mn + 1;
while ( j <= mx ){
auto [l, r] = qry(j, j + lb - 1);
if ( l != -1 ){
opt = max(opt, l - pv);
pv = r;
}
j += lb;
}
return opt;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
6 |
Incorrect |
1 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 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
16 |
Incorrect |
8 ms |
2588 KB |
Output isn't correct |
17 |
Incorrect |
9 ms |
2392 KB |
Output isn't correct |
18 |
Incorrect |
8 ms |
2392 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
2392 KB |
Output isn't correct |
20 |
Incorrect |
5 ms |
2392 KB |
Output isn't correct |
21 |
Incorrect |
45 ms |
2648 KB |
Output isn't correct |
22 |
Incorrect |
35 ms |
2648 KB |
Output isn't correct |
23 |
Incorrect |
36 ms |
2648 KB |
Output isn't correct |
24 |
Incorrect |
35 ms |
2648 KB |
Output isn't correct |
25 |
Incorrect |
33 ms |
2648 KB |
Output isn't correct |
26 |
Incorrect |
38 ms |
2648 KB |
Output isn't correct |
27 |
Incorrect |
36 ms |
2648 KB |
Output isn't correct |
28 |
Incorrect |
43 ms |
2644 KB |
Output isn't correct |
29 |
Incorrect |
36 ms |
2648 KB |
Output isn't correct |
30 |
Incorrect |
22 ms |
2820 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 |
Correct |
0 ms |
2392 KB |
Output is correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2392 KB |
Output is correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
0 ms |
2392 KB |
Output is correct |
9 |
Correct |
0 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 |
2396 KB |
Output is correct |
14 |
Correct |
1 ms |
2396 KB |
Output is correct |
15 |
Correct |
1 ms |
2396 KB |
Output is correct |
16 |
Correct |
9 ms |
2396 KB |
Output is correct |
17 |
Correct |
11 ms |
2396 KB |
Output is correct |
18 |
Correct |
11 ms |
2396 KB |
Output is correct |
19 |
Correct |
10 ms |
2396 KB |
Output is correct |
20 |
Partially correct |
5 ms |
2396 KB |
Partially correct |
21 |
Correct |
35 ms |
2740 KB |
Output is correct |
22 |
Correct |
45 ms |
2648 KB |
Output is correct |
23 |
Correct |
36 ms |
2648 KB |
Output is correct |
24 |
Correct |
54 ms |
2648 KB |
Output is correct |
25 |
Correct |
34 ms |
2648 KB |
Output is correct |
26 |
Correct |
38 ms |
2648 KB |
Output is correct |
27 |
Correct |
36 ms |
1112 KB |
Output is correct |
28 |
Correct |
37 ms |
1112 KB |
Output is correct |
29 |
Correct |
45 ms |
2648 KB |
Output is correct |
30 |
Partially correct |
25 ms |
1112 KB |
Partially correct |
31 |
Correct |
1 ms |
344 KB |
Output is correct |
32 |
Correct |
1 ms |
344 KB |
Output is correct |