#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 2e18;
ll findGap(int T, int N) {
ll L, R;
MinMax(0,inf,&L,&R);
ll all = R-L-1;
ll sz = all/(N-1);
ll last = L;
ll ans = 0;
for(ll x=L+1;x<R;x+=sz) {
ll t1, t2;
MinMax(x,min(R-1,x+sz-1),&t1,&t2);
if(t1==-1) continue;
ans = max(ans, t1-last);
last = t2;
}
ans = max(ans, R-last);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
436 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
664 KB |
Output isn't correct |
11 |
Incorrect |
3 ms |
664 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
664 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
664 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
664 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
664 KB |
Output isn't correct |
16 |
Incorrect |
22 ms |
692 KB |
Output isn't correct |
17 |
Incorrect |
24 ms |
740 KB |
Output isn't correct |
18 |
Incorrect |
21 ms |
740 KB |
Output isn't correct |
19 |
Incorrect |
20 ms |
740 KB |
Output isn't correct |
20 |
Incorrect |
11 ms |
740 KB |
Output isn't correct |
21 |
Incorrect |
74 ms |
1428 KB |
Output isn't correct |
22 |
Incorrect |
75 ms |
1508 KB |
Output isn't correct |
23 |
Incorrect |
75 ms |
1508 KB |
Output isn't correct |
24 |
Incorrect |
75 ms |
1508 KB |
Output isn't correct |
25 |
Incorrect |
68 ms |
1508 KB |
Output isn't correct |
26 |
Incorrect |
74 ms |
1512 KB |
Output isn't correct |
27 |
Incorrect |
75 ms |
1512 KB |
Output isn't correct |
28 |
Incorrect |
75 ms |
1512 KB |
Output isn't correct |
29 |
Incorrect |
78 ms |
1512 KB |
Output isn't correct |
30 |
Incorrect |
39 ms |
1512 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
1512 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
1512 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1512 KB |
Output is correct |
2 |
Correct |
2 ms |
1512 KB |
Output is correct |
3 |
Correct |
2 ms |
1512 KB |
Output is correct |
4 |
Correct |
2 ms |
1512 KB |
Output is correct |
5 |
Correct |
2 ms |
1512 KB |
Output is correct |
6 |
Correct |
2 ms |
1512 KB |
Output is correct |
7 |
Correct |
2 ms |
1512 KB |
Output is correct |
8 |
Correct |
2 ms |
1512 KB |
Output is correct |
9 |
Correct |
2 ms |
1512 KB |
Output is correct |
10 |
Correct |
2 ms |
1512 KB |
Output is correct |
11 |
Correct |
3 ms |
1512 KB |
Output is correct |
12 |
Correct |
3 ms |
1512 KB |
Output is correct |
13 |
Correct |
3 ms |
1512 KB |
Output is correct |
14 |
Correct |
3 ms |
1512 KB |
Output is correct |
15 |
Correct |
3 ms |
1512 KB |
Output is correct |
16 |
Correct |
20 ms |
1512 KB |
Output is correct |
17 |
Correct |
20 ms |
1512 KB |
Output is correct |
18 |
Correct |
19 ms |
1512 KB |
Output is correct |
19 |
Correct |
19 ms |
1512 KB |
Output is correct |
20 |
Partially correct |
9 ms |
1512 KB |
Partially correct |
21 |
Correct |
81 ms |
1512 KB |
Output is correct |
22 |
Correct |
74 ms |
1512 KB |
Output is correct |
23 |
Correct |
73 ms |
1512 KB |
Output is correct |
24 |
Correct |
76 ms |
1512 KB |
Output is correct |
25 |
Correct |
68 ms |
1512 KB |
Output is correct |
26 |
Correct |
76 ms |
1512 KB |
Output is correct |
27 |
Correct |
73 ms |
1512 KB |
Output is correct |
28 |
Correct |
76 ms |
1512 KB |
Output is correct |
29 |
Correct |
74 ms |
1512 KB |
Output is correct |
30 |
Partially correct |
39 ms |
1512 KB |
Partially correct |
31 |
Correct |
2 ms |
1512 KB |
Output is correct |
32 |
Correct |
2 ms |
1512 KB |
Output is correct |