#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
long long findGap(int T, int N)
{
if(T == 1)
{
long long l = 0;
long long r = inf;
long long rez = 0;
vector<long long> nizl;
vector<long long> nizr;
while(l<=r)
{
long long a;
long long b;
MinMax(l, r, &a ,&b);
if(a==-1)break;
l = a+1;
r = b-1;
if(a!=b)
{
nizl.push_back(a);
nizr.push_back(b);
}
else nizl.pb(a);
}
reverse(all(nizr));
vector<long long> merged(nizl.size()+ nizr.size());
merge(all(nizl), all(nizr), merged.begin());
for(int i=0; i<N-1; i++) rez = max(rez, merged[i+1] - merged[i]);
return rez;
}
else
{
}
}
/*
1 4
2 3 6 8
*/
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
51 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Correct |
0 ms |
2392 KB |
Output is correct |
3 |
Correct |
0 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2392 KB |
Output is correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
10 |
Correct |
1 ms |
2392 KB |
Output is 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 |
8 ms |
2996 KB |
Output isn't correct |
17 |
Incorrect |
6 ms |
3076 KB |
Output isn't correct |
18 |
Incorrect |
7 ms |
2904 KB |
Output isn't correct |
19 |
Incorrect |
7 ms |
2904 KB |
Output isn't correct |
20 |
Correct |
5 ms |
2904 KB |
Output is correct |
21 |
Incorrect |
25 ms |
4472 KB |
Output isn't correct |
22 |
Incorrect |
26 ms |
4468 KB |
Output isn't correct |
23 |
Incorrect |
28 ms |
4476 KB |
Output isn't correct |
24 |
Incorrect |
29 ms |
4360 KB |
Output isn't correct |
25 |
Incorrect |
26 ms |
4468 KB |
Output isn't correct |
26 |
Incorrect |
27 ms |
4368 KB |
Output isn't correct |
27 |
Incorrect |
26 ms |
4468 KB |
Output isn't correct |
28 |
Incorrect |
25 ms |
4488 KB |
Output isn't correct |
29 |
Incorrect |
33 ms |
4424 KB |
Output isn't correct |
30 |
Correct |
21 ms |
4476 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
0 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2392 KB |
Output is correct |
2 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
3 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
4 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
6 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
7 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
9 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
10 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
13 |
Partially correct |
1 ms |
2528 KB |
Partially correct |
14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
16 |
Partially correct |
6 ms |
2904 KB |
Partially correct |
17 |
Partially correct |
6 ms |
2904 KB |
Partially correct |
18 |
Partially correct |
6 ms |
2904 KB |
Partially correct |
19 |
Partially correct |
10 ms |
3332 KB |
Partially correct |
20 |
Partially correct |
5 ms |
2904 KB |
Partially correct |
21 |
Incorrect |
34 ms |
4384 KB |
Expected int32, but "2500100001" found |
22 |
Incorrect |
25 ms |
4476 KB |
Expected int32, but "2500100001" found |
23 |
Incorrect |
27 ms |
4476 KB |
Expected int32, but "2500100001" found |
24 |
Incorrect |
27 ms |
4464 KB |
Expected int32, but "2500100001" found |
25 |
Incorrect |
31 ms |
4484 KB |
Expected int32, but "2500100001" found |
26 |
Incorrect |
32 ms |
4468 KB |
Expected int32, but "2500100001" found |
27 |
Incorrect |
26 ms |
4360 KB |
Expected int32, but "2500100001" found |
28 |
Incorrect |
25 ms |
4476 KB |
Expected int32, but "2500100001" found |
29 |
Incorrect |
25 ms |
4468 KB |
Expected int32, but "2500100001" found |
30 |
Incorrect |
25 ms |
4520 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
32 |
Partially correct |
0 ms |
2392 KB |
Partially correct |