#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int N) //probably again different solution for different test cases :(
{
if(T == 1) {
// cerr << "entered?" << endl;
vector<ll> v(N);
ll mini = -1, maksi = ll(1e18) + 1;
for(int i = 0; i < N; ++i) {
if(i > N - i - 1) break;
++mini, --maksi;
MinMax(mini, maksi, &mini, &maksi);
// cerr << mini << " " << maksi << '\n';
v[i] = mini;
v[N - i - 1] = maksi;
}
ll ans = 0;
for(int i = 1; i < N; ++i) {
ans = max(ans, v[i] - v[i - 1]);
}
return ans;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
0 ms |
208 KB |
Output is correct |
8 |
Correct |
1 ms |
208 KB |
Output is correct |
9 |
Correct |
0 ms |
208 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
336 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
10 ms |
684 KB |
Output is correct |
17 |
Correct |
9 ms |
720 KB |
Output is correct |
18 |
Correct |
12 ms |
684 KB |
Output is correct |
19 |
Correct |
9 ms |
720 KB |
Output is correct |
20 |
Correct |
8 ms |
720 KB |
Output is correct |
21 |
Correct |
49 ms |
1788 KB |
Output is correct |
22 |
Correct |
38 ms |
1868 KB |
Output is correct |
23 |
Correct |
38 ms |
1828 KB |
Output is correct |
24 |
Correct |
38 ms |
1820 KB |
Output is correct |
25 |
Correct |
43 ms |
1852 KB |
Output is correct |
26 |
Correct |
40 ms |
1828 KB |
Output is correct |
27 |
Correct |
39 ms |
1780 KB |
Output is correct |
28 |
Correct |
39 ms |
1764 KB |
Output is correct |
29 |
Correct |
43 ms |
1872 KB |
Output is correct |
30 |
Correct |
35 ms |
1800 KB |
Output is correct |
31 |
Correct |
0 ms |
208 KB |
Output is correct |
32 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
312 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
432 KB |
Output isn't correct |
17 |
Incorrect |
6 ms |
448 KB |
Output isn't correct |
18 |
Incorrect |
5 ms |
464 KB |
Output isn't correct |
19 |
Incorrect |
6 ms |
464 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
464 KB |
Output isn't correct |
21 |
Incorrect |
20 ms |
1064 KB |
Output isn't correct |
22 |
Incorrect |
20 ms |
968 KB |
Output isn't correct |
23 |
Incorrect |
27 ms |
1048 KB |
Output isn't correct |
24 |
Incorrect |
23 ms |
1088 KB |
Output isn't correct |
25 |
Incorrect |
14 ms |
1028 KB |
Output isn't correct |
26 |
Incorrect |
27 ms |
1004 KB |
Output isn't correct |
27 |
Incorrect |
24 ms |
1180 KB |
Output isn't correct |
28 |
Incorrect |
28 ms |
968 KB |
Output isn't correct |
29 |
Incorrect |
30 ms |
968 KB |
Output isn't correct |
30 |
Incorrect |
17 ms |
1004 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
208 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
208 KB |
Output isn't correct |