#include <bits/stdc++.h>
#include "gap.h";
using namespace std;
long long a[100005];
long long findGap(int T, int n)
{
if(T==1)
{
MinMax(0,1e18,&a[1],&a[n]);
int i=2,j=n-1;
while(i<=j)
{
MinMax(a[i-1]+1,a[j+1]-1,&a[i],&a[j]);
i++;
j--;
}
long long res=0;
for(int i=2; i<=n; i++)
res=max(res,a[i]-a[i-1]);
return res;
}
else
{
for(int i=1;i<=n;i++)
a[i]=-1;
MinMax(0,1e18,&a[1],&a[n]);
int i=2,j=n-1,Count=0;
while(i<=j)
{
Count++;
if(Count>100)
break;
MinMax(a[i-1]+1,a[j+1]-1,&a[i],&a[j]);
i++;
j--;
}
long long res=0;
for(int i=2; i<=n; i++)
if(a[i]!=-1&&a[i-1]!=-1)
res=max(res,a[i]-a[i-1]);
return res;
}
}
Compilation message
gap.cpp:2:17: warning: extra tokens at end of #include directive
#include "gap.h";
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5920 KB |
Output is correct |
2 |
Correct |
0 ms |
5920 KB |
Output is correct |
3 |
Correct |
0 ms |
5920 KB |
Output is correct |
4 |
Correct |
0 ms |
5920 KB |
Output is correct |
5 |
Correct |
0 ms |
5920 KB |
Output is correct |
6 |
Correct |
0 ms |
5920 KB |
Output is correct |
7 |
Correct |
0 ms |
5920 KB |
Output is correct |
8 |
Correct |
0 ms |
5920 KB |
Output is correct |
9 |
Correct |
0 ms |
5920 KB |
Output is correct |
10 |
Correct |
0 ms |
5920 KB |
Output is correct |
11 |
Correct |
0 ms |
5920 KB |
Output is correct |
12 |
Correct |
0 ms |
5920 KB |
Output is correct |
13 |
Correct |
0 ms |
5920 KB |
Output is correct |
14 |
Correct |
0 ms |
5920 KB |
Output is correct |
15 |
Correct |
0 ms |
5920 KB |
Output is correct |
16 |
Correct |
9 ms |
5920 KB |
Output is correct |
17 |
Correct |
13 ms |
5920 KB |
Output is correct |
18 |
Correct |
9 ms |
5920 KB |
Output is correct |
19 |
Correct |
13 ms |
5920 KB |
Output is correct |
20 |
Correct |
9 ms |
5920 KB |
Output is correct |
21 |
Correct |
49 ms |
5920 KB |
Output is correct |
22 |
Correct |
63 ms |
5920 KB |
Output is correct |
23 |
Correct |
59 ms |
5920 KB |
Output is correct |
24 |
Correct |
56 ms |
5920 KB |
Output is correct |
25 |
Correct |
43 ms |
5920 KB |
Output is correct |
26 |
Correct |
53 ms |
5920 KB |
Output is correct |
27 |
Correct |
53 ms |
5920 KB |
Output is correct |
28 |
Correct |
59 ms |
5920 KB |
Output is correct |
29 |
Correct |
56 ms |
5920 KB |
Output is correct |
30 |
Correct |
39 ms |
5920 KB |
Output is correct |
31 |
Correct |
0 ms |
5920 KB |
Output is correct |
32 |
Correct |
0 ms |
5920 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5920 KB |
Output is correct |
2 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
3 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
4 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
5 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
6 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
7 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
8 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
9 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
10 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
11 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
13 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
14 |
Incorrect |
0 ms |
5920 KB |
Output isn't correct |
15 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
16 |
Incorrect |
6 ms |
5920 KB |
Output isn't correct |
17 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
18 |
Incorrect |
6 ms |
5920 KB |
Output isn't correct |
19 |
Incorrect |
6 ms |
5920 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
5920 KB |
Output isn't correct |
21 |
Incorrect |
23 ms |
5920 KB |
Output isn't correct |
22 |
Incorrect |
33 ms |
5920 KB |
Output isn't correct |
23 |
Incorrect |
33 ms |
5920 KB |
Output isn't correct |
24 |
Incorrect |
29 ms |
5920 KB |
Output isn't correct |
25 |
Partially correct |
23 ms |
5920 KB |
Partially correct |
26 |
Incorrect |
26 ms |
5920 KB |
Output isn't correct |
27 |
Incorrect |
33 ms |
5920 KB |
Output isn't correct |
28 |
Incorrect |
26 ms |
5920 KB |
Output isn't correct |
29 |
Incorrect |
29 ms |
5920 KB |
Output isn't correct |
30 |
Incorrect |
9 ms |
5920 KB |
Output isn't correct |
31 |
Partially correct |
0 ms |
5920 KB |
Partially correct |
32 |
Partially correct |
0 ms |
5920 KB |
Partially correct |