#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
ll findGap(int T, int N){
if (T == 1){
vector<ll> vec;
while (N > 0){
N -= 2;
ll mn = 0, mx = 1e18;
MinMax(mn, mx, &mn, &mx);
vec.push_back(mn);
vec.push_back(mx);
mn++;
mx--;
}
sort(vec.begin(), vec.end());
ll res = 0;
for (int i = 1; i < N; i ++)
res = max(res, vec[i] - vec[i - 1]);
return res;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Incorrect |
0 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 |
0 ms |
344 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
16 |
Incorrect |
5 ms |
960 KB |
Output isn't correct |
17 |
Incorrect |
5 ms |
980 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
980 KB |
Output isn't correct |
19 |
Incorrect |
5 ms |
980 KB |
Output isn't correct |
20 |
Incorrect |
5 ms |
980 KB |
Output isn't correct |
21 |
Incorrect |
27 ms |
2256 KB |
Output isn't correct |
22 |
Incorrect |
19 ms |
2256 KB |
Output isn't correct |
23 |
Incorrect |
30 ms |
2256 KB |
Output isn't correct |
24 |
Incorrect |
21 ms |
2256 KB |
Output isn't correct |
25 |
Incorrect |
17 ms |
2256 KB |
Output isn't correct |
26 |
Incorrect |
20 ms |
2180 KB |
Output isn't correct |
27 |
Incorrect |
29 ms |
2248 KB |
Output isn't correct |
28 |
Incorrect |
28 ms |
2420 KB |
Output isn't correct |
29 |
Incorrect |
23 ms |
2256 KB |
Output isn't correct |
30 |
Incorrect |
16 ms |
2256 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
344 KB |
Output isn't 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 |
0 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 |
1 ms |
344 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
16 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
17 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
18 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
19 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
21 |
Incorrect |
18 ms |
1124 KB |
Output isn't correct |
22 |
Incorrect |
20 ms |
1128 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
1116 KB |
Output isn't correct |
24 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
25 |
Incorrect |
17 ms |
1164 KB |
Output isn't correct |
26 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
27 |
Incorrect |
14 ms |
1112 KB |
Output isn't correct |
28 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
29 |
Incorrect |
12 ms |
1112 KB |
Output isn't correct |
30 |
Incorrect |
14 ms |
1112 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |