#include <bits/stdc++.h>
#include "gap.h"
#define se second
#define fi first
using namespace std;
long long ans;
long double bb;
void func (long long L,long long R)
{
long long mi1,ma1,mi2,ma2;
long long mid=(L+R)/2;
MinMax(L,mid,&mi1,&ma1);
MinMax(mid,R,&mi2,&ma2);
if (ma1==-1 && mi2==-1) {
ans=max(ans,R-L);
return;
}
if (ma1==-1) {
ans=max(ans,mi2-L);
return;
}
if (mi2==-1) {
ans=max(ans,R-ma1);
return;
}
if (ma1==L && mi2==R){
ans=max(ans,R-L);
return;
}
if (R-L==1){
ans=max(ans,R-L);
return;
}
if (ma1-L>ans && ma1-L>=bb)
func(L,ma1);
if (R-mi2>ans && R-mi2>=bb)
func(mi2,R);
if (mi2-ma1>ans && mi2-ma1>=bb)
func (ma1,mi2);
}
long long findGap(int T, int N)
{
long long m=(long long)N;
long long Mn,Mx;
long long S=0;
long long TT=1000000000000000000;
MinMax(S,TT,&Mn,&Mx);
if (m==2)
return Mx-Mn;
bb=((Mx-Mn)*1.0)/((m-1)*1.0);
ans=0;
if (T==2) {
func (Mn,Mx);
return ans;
}
else {
for (int i=1;i<(N+1)/2;i++){
long long mmn, mmx;
MinMax(Mn+1,Mx-1,&mmn,&mmx);
ans=max(ans,mmn-Mn);
ans=max(ans,Mx-mmx);
Mn=mmn;
Mx=mmx;
}
ans=max(ans,Mx-Mn);
return ans;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5140 KB |
Output is correct |
2 |
Correct |
0 ms |
5140 KB |
Output is correct |
3 |
Correct |
0 ms |
5140 KB |
Output is correct |
4 |
Correct |
0 ms |
5140 KB |
Output is correct |
5 |
Correct |
0 ms |
5140 KB |
Output is correct |
6 |
Correct |
0 ms |
5140 KB |
Output is correct |
7 |
Correct |
0 ms |
5140 KB |
Output is correct |
8 |
Correct |
0 ms |
5140 KB |
Output is correct |
9 |
Correct |
0 ms |
5140 KB |
Output is correct |
10 |
Correct |
0 ms |
5140 KB |
Output is correct |
11 |
Correct |
0 ms |
5140 KB |
Output is correct |
12 |
Correct |
0 ms |
5140 KB |
Output is correct |
13 |
Correct |
0 ms |
5140 KB |
Output is correct |
14 |
Correct |
0 ms |
5140 KB |
Output is correct |
15 |
Correct |
0 ms |
5140 KB |
Output is correct |
16 |
Correct |
16 ms |
5140 KB |
Output is correct |
17 |
Correct |
13 ms |
5140 KB |
Output is correct |
18 |
Correct |
19 ms |
5140 KB |
Output is correct |
19 |
Correct |
9 ms |
5140 KB |
Output is correct |
20 |
Correct |
9 ms |
5140 KB |
Output is correct |
21 |
Correct |
73 ms |
5140 KB |
Output is correct |
22 |
Correct |
69 ms |
5140 KB |
Output is correct |
23 |
Correct |
63 ms |
5140 KB |
Output is correct |
24 |
Correct |
59 ms |
5140 KB |
Output is correct |
25 |
Correct |
56 ms |
5140 KB |
Output is correct |
26 |
Correct |
76 ms |
5140 KB |
Output is correct |
27 |
Correct |
63 ms |
5140 KB |
Output is correct |
28 |
Correct |
59 ms |
5140 KB |
Output is correct |
29 |
Correct |
63 ms |
5140 KB |
Output is correct |
30 |
Correct |
43 ms |
5140 KB |
Output is correct |
31 |
Correct |
0 ms |
5140 KB |
Output is correct |
32 |
Correct |
0 ms |
5140 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5140 KB |
Output is correct |
2 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
3 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
4 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
5 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
6 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
7 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
8 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
9 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
10 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
11 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
12 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
13 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
14 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
15 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
16 |
Partially correct |
13 ms |
5140 KB |
Partially correct |
17 |
Partially correct |
9 ms |
5140 KB |
Partially correct |
18 |
Partially correct |
16 ms |
5140 KB |
Partially correct |
19 |
Partially correct |
13 ms |
5140 KB |
Partially correct |
20 |
Partially correct |
6 ms |
5140 KB |
Partially correct |
21 |
Partially correct |
49 ms |
5140 KB |
Partially correct |
22 |
Partially correct |
46 ms |
5140 KB |
Partially correct |
23 |
Partially correct |
36 ms |
5140 KB |
Partially correct |
24 |
Partially correct |
49 ms |
5140 KB |
Partially correct |
25 |
Partially correct |
96 ms |
5140 KB |
Partially correct |
26 |
Partially correct |
53 ms |
5140 KB |
Partially correct |
27 |
Partially correct |
53 ms |
5140 KB |
Partially correct |
28 |
Partially correct |
46 ms |
5140 KB |
Partially correct |
29 |
Partially correct |
43 ms |
5140 KB |
Partially correct |
30 |
Partially correct |
16 ms |
5140 KB |
Partially correct |
31 |
Partially correct |
0 ms |
5140 KB |
Partially correct |
32 |
Partially correct |
0 ms |
5140 KB |
Partially correct |