#include "gap.h"
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
long long findGap(int T, int n)
{
ll ans = 0;
if(T == 1){
ll l = 0, r = INF;
ll mn, mx;
vector<ll> a(n+1);
for(int i = 1; i <= (n+1)/2; i++){
MinMax(l, r, &mn, &mx);
a[i] = mn; a[n-i+1] = mx;
l = mn+1, r = mx-1;
}
for(int i = 2; i <= n; i++){
ans = max(ans, a[i]-a[i-1]);
}
}else{
return 0;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 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 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
0 ms |
344 KB |
Output is correct |
16 |
Correct |
7 ms |
856 KB |
Output is correct |
17 |
Correct |
7 ms |
856 KB |
Output is correct |
18 |
Correct |
6 ms |
856 KB |
Output is correct |
19 |
Correct |
7 ms |
856 KB |
Output is correct |
20 |
Correct |
5 ms |
856 KB |
Output is correct |
21 |
Correct |
27 ms |
1880 KB |
Output is correct |
22 |
Correct |
27 ms |
1880 KB |
Output is correct |
23 |
Correct |
26 ms |
1880 KB |
Output is correct |
24 |
Correct |
26 ms |
1880 KB |
Output is correct |
25 |
Correct |
23 ms |
1880 KB |
Output is correct |
26 |
Correct |
28 ms |
1880 KB |
Output is correct |
27 |
Correct |
27 ms |
1880 KB |
Output is correct |
28 |
Correct |
26 ms |
1880 KB |
Output is correct |
29 |
Correct |
26 ms |
1820 KB |
Output is correct |
30 |
Correct |
21 ms |
1880 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
344 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 |
0 ms |
344 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
11 |
Incorrect |
0 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 |
0 ms |
344 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
16 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
17 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
600 KB |
Output isn't correct |
19 |
Incorrect |
6 ms |
436 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
21 |
Incorrect |
15 ms |
1104 KB |
Output isn't correct |
22 |
Incorrect |
13 ms |
1108 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
24 |
Incorrect |
23 ms |
1104 KB |
Output isn't correct |
25 |
Incorrect |
11 ms |
1132 KB |
Output isn't correct |
26 |
Incorrect |
12 ms |
1364 KB |
Output isn't correct |
27 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
28 |
Incorrect |
23 ms |
1104 KB |
Output isn't correct |
29 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
30 |
Incorrect |
7 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 |