#include "gap.h"
#include <bits/stdc++.h>
using i64=long long;
const i64 INF=1e18;
long long findGap(int test, int n)
{
i64 rez=0;
if (test == 0)
{
i64 l=1,r=INF;
std::vector<int>a;
for(int i=0;i<n/2+1,l<=r;i++)
{
MinMax(l,r,&l,&r);
a.push_back(l);
a.push_back(r);
l++;
r--;
}
sort(a.begin(),a.end());
rez=0;
i64 last=a[0];
for(auto &c:a)
{
rez=std::max(rez , c-last);
last=a[0];
}
}
else
{
i64 l,r;
MinMax(1,INF,&l,&r);
if(l==r)
{
return 0;
}
const i64 at_least_gap=(r-l+n-2)/(n-1);
rez=at_least_gap;
for(i64 i=l,last=l;i<=r;i+=at_least_gap)
{
i64 mn,mx;
MinMax(i,i+at_least_gap-1,&mn,&mx);
if(mn!=-1)
{
rez=std::max(rez , mn-last);
last=mx;
}
}
}
return rez;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:12:22: warning: left operand of comma operator has no effect [-Wunused-value]
12 | for(int i=0;i<n/2+1,l<=r;i++)
| ~^~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
2552 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 |
1 ms |
2384 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
2384 KB |
Output isn't correct |
17 |
Incorrect |
10 ms |
2384 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
2768 KB |
Output isn't correct |
19 |
Incorrect |
9 ms |
2552 KB |
Output isn't correct |
20 |
Incorrect |
5 ms |
2384 KB |
Output isn't correct |
21 |
Incorrect |
34 ms |
2640 KB |
Output isn't correct |
22 |
Incorrect |
38 ms |
2640 KB |
Output isn't correct |
23 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
24 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
25 |
Incorrect |
32 ms |
2640 KB |
Output isn't correct |
26 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
27 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
28 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
29 |
Incorrect |
34 ms |
2640 KB |
Output isn't correct |
30 |
Incorrect |
21 ms |
2640 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
2 |
Correct |
1 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 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
6 |
Correct |
1 ms |
2384 KB |
Output is correct |
7 |
Correct |
1 ms |
2384 KB |
Output is correct |
8 |
Correct |
1 ms |
2384 KB |
Output is correct |
9 |
Correct |
1 ms |
2384 KB |
Output is correct |
10 |
Correct |
1 ms |
2384 KB |
Output is correct |
11 |
Correct |
1 ms |
2384 KB |
Output is correct |
12 |
Correct |
1 ms |
2384 KB |
Output is correct |
13 |
Correct |
1 ms |
2384 KB |
Output is correct |
14 |
Correct |
1 ms |
2384 KB |
Output is correct |
15 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
16 |
Correct |
11 ms |
2600 KB |
Output is correct |
17 |
Correct |
9 ms |
2384 KB |
Output is correct |
18 |
Correct |
9 ms |
2528 KB |
Output is correct |
19 |
Correct |
9 ms |
2384 KB |
Output is correct |
20 |
Correct |
5 ms |
2384 KB |
Output is correct |
21 |
Correct |
35 ms |
2640 KB |
Output is correct |
22 |
Correct |
34 ms |
2640 KB |
Output is correct |
23 |
Correct |
34 ms |
2640 KB |
Output is correct |
24 |
Correct |
34 ms |
2640 KB |
Output is correct |
25 |
Partially correct |
33 ms |
2640 KB |
Partially correct |
26 |
Correct |
44 ms |
2856 KB |
Output is correct |
27 |
Correct |
34 ms |
2640 KB |
Output is correct |
28 |
Correct |
42 ms |
2768 KB |
Output is correct |
29 |
Correct |
35 ms |
2640 KB |
Output is correct |
30 |
Correct |
22 ms |
2640 KB |
Output is correct |
31 |
Partially correct |
1 ms |
2384 KB |
Partially correct |
32 |
Partially correct |
1 ms |
2384 KB |
Partially correct |