#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long n;
vector<long long> v;
void solve(long long l,long long r)
{
if(l>r)return;
//cout<<l<<" "<<r<<" "<<ll<<" "<<rr<<endl;
long long len=r-l+1;
long long b=len;
long long mn=0,mx=0;
MinMax(l,r,&mn,&mx);
if(mn==-1)return;
v.push_back(mn);
if(mn!=mx)v.push_back(mx);
solve(mn+1,mx-1);
}
long long findGap(int t,int N)
{
n=N;
solve(0,1e18);
long long ans=0;
sort(v.begin(),v.end());
for(int i=1;i<v.size();i++)
ans=max(ans,v[i]-v[i-1]);
return ans;
}
/*int main()
{
long long d=0;
int x;
cin>>x>>nn;
for(int i=1;i<=nn;i++)
{
cin>>a[i];
if(i!=1)d=max(d,a[i]-a[i-1]);
}
long long answer=findGap(1,nn);
cout<<d<<" "<<answer<<endl;
}*/
Compilation message
gap.cpp: In function 'void solve(long long int, long long int)':
gap.cpp:13:15: warning: unused variable 'b' [-Wunused-variable]
13 | long long b=len;
| ^
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:32:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for(int i=1;i<v.size();i++)
| ~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Correct |
2 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
2 ms |
2384 KB |
Output is correct |
6 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
10 |
Correct |
1 ms |
2384 KB |
Output is correct |
11 |
Incorrect |
2 ms |
2552 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
2552 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
16 |
Incorrect |
12 ms |
3532 KB |
Output isn't correct |
17 |
Incorrect |
9 ms |
3532 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
3496 KB |
Output isn't correct |
19 |
Incorrect |
9 ms |
3444 KB |
Output isn't correct |
20 |
Correct |
8 ms |
3532 KB |
Output is correct |
21 |
Incorrect |
36 ms |
6660 KB |
Output isn't correct |
22 |
Incorrect |
34 ms |
6852 KB |
Output isn't correct |
23 |
Incorrect |
42 ms |
6844 KB |
Output isn't correct |
24 |
Incorrect |
34 ms |
6664 KB |
Output isn't correct |
25 |
Incorrect |
31 ms |
6860 KB |
Output isn't correct |
26 |
Incorrect |
35 ms |
7016 KB |
Output isn't correct |
27 |
Incorrect |
45 ms |
6724 KB |
Output isn't correct |
28 |
Incorrect |
34 ms |
6844 KB |
Output isn't correct |
29 |
Incorrect |
34 ms |
6852 KB |
Output isn't correct |
30 |
Correct |
29 ms |
6852 KB |
Output is correct |
31 |
Correct |
1 ms |
2384 KB |
Output is correct |
32 |
Correct |
1 ms |
2384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
3 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
4 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
5 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
6 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
7 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
8 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
9 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
10 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
11 |
Partially correct |
2 ms |
2384 KB |
Partially correct |
12 |
Partially correct |
2 ms |
2384 KB |
Partially correct |
13 |
Partially correct |
2 ms |
2384 KB |
Partially correct |
14 |
Partially correct |
2 ms |
2384 KB |
Partially correct |
15 |
Partially correct |
2 ms |
2384 KB |
Partially correct |
16 |
Partially correct |
9 ms |
3532 KB |
Partially correct |
17 |
Partially correct |
13 ms |
3532 KB |
Partially correct |
18 |
Partially correct |
9 ms |
3532 KB |
Partially correct |
19 |
Partially correct |
12 ms |
3532 KB |
Partially correct |
20 |
Partially correct |
8 ms |
3532 KB |
Partially correct |
21 |
Incorrect |
36 ms |
6756 KB |
Expected int32, but "2500100001" found |
22 |
Incorrect |
39 ms |
6888 KB |
Expected int32, but "2500100001" found |
23 |
Incorrect |
36 ms |
6768 KB |
Expected int32, but "2500100001" found |
24 |
Incorrect |
37 ms |
6852 KB |
Expected int32, but "2500100001" found |
25 |
Incorrect |
32 ms |
6852 KB |
Expected int32, but "2500100001" found |
26 |
Incorrect |
36 ms |
6844 KB |
Expected int32, but "2500100001" found |
27 |
Incorrect |
36 ms |
6844 KB |
Expected int32, but "2500100001" found |
28 |
Incorrect |
35 ms |
7020 KB |
Expected int32, but "2500100001" found |
29 |
Incorrect |
47 ms |
6680 KB |
Expected int32, but "2500100001" found |
30 |
Incorrect |
29 ms |
6844 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
32 |
Partially correct |
1 ms |
2384 KB |
Partially correct |