#include "bits/stdc++.h"
#include "gap.h"
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define ll long long
ll findGap(int t, int n){
ll answer = 0;
if(t == 1){
ll l = 1, r = 1e18, id = 0, mn, mx;
vector<ll> a;
a.resize(n+5);
for(int i = 0; i < (n+1)/2; ++i){
MinMax(l, r, &mn, &mx);
a[id++] = mn;
a[id++] = mx;
l = mn+1, r = mx-1;
}
sort(all(a));
for(int i = 0; i < n-1; ++i)
answer = max(answer, a[i+1]-a[i]);
return answer;
}
return answer;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
3 |
Correct |
0 ms |
2392 KB |
Output is correct |
4 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2392 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 |
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 |
2 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 |
8 ms |
2648 KB |
Output is correct |
17 |
Correct |
8 ms |
2648 KB |
Output is correct |
18 |
Correct |
7 ms |
2648 KB |
Output is correct |
19 |
Correct |
13 ms |
2648 KB |
Output is correct |
20 |
Correct |
8 ms |
2648 KB |
Output is correct |
21 |
Correct |
40 ms |
3532 KB |
Output is correct |
22 |
Correct |
30 ms |
3416 KB |
Output is correct |
23 |
Correct |
41 ms |
3460 KB |
Output is correct |
24 |
Correct |
31 ms |
3416 KB |
Output is correct |
25 |
Incorrect |
37 ms |
3412 KB |
Output isn't correct |
26 |
Correct |
34 ms |
3416 KB |
Output is correct |
27 |
Correct |
33 ms |
3412 KB |
Output is correct |
28 |
Correct |
32 ms |
3416 KB |
Output is correct |
29 |
Correct |
38 ms |
3416 KB |
Output is correct |
30 |
Correct |
34 ms |
3416 KB |
Output is correct |
31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
1 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 |
5 ms |
2540 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
2392 KB |
Output isn't correct |
18 |
Incorrect |
6 ms |
2536 KB |
Output isn't correct |
19 |
Incorrect |
4 ms |
2396 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
2392 KB |
Output isn't correct |
21 |
Incorrect |
20 ms |
2800 KB |
Output isn't correct |
22 |
Incorrect |
15 ms |
2716 KB |
Output isn't correct |
23 |
Incorrect |
16 ms |
2708 KB |
Output isn't correct |
24 |
Incorrect |
13 ms |
2756 KB |
Output isn't correct |
25 |
Incorrect |
11 ms |
2648 KB |
Output isn't correct |
26 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
27 |
Incorrect |
20 ms |
2848 KB |
Output isn't correct |
28 |
Incorrect |
18 ms |
1216 KB |
Output isn't correct |
29 |
Incorrect |
17 ms |
1112 KB |
Output isn't correct |
30 |
Incorrect |
8 ms |
1112 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |