#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findGap(int T, int N)
{
ll mn=0,mx=(ll)2e18,tmn,tmx,ans=0;
if(T==1){
MinMax(mn,mx,&tmn,&tmx);
if(N==2) return tmx-tmn;
mn=tmn,mx=tmx;
for(int i=1;2*i<=N-1;i++){
MinMax(mn+1,mx-1,&tmn,&tmx);
if(tmx==-1){
ans=max(ans,mx-mn);
break;
}
//printf("%lld %lld %lld %lld\n",mn,mx,tmn,tmx);
ans=max(ans,max(tmn-mn,mx-tmx));
mn=tmn,mx=tmx;
}
ans=max(mx-mn,ans);
return ans;
}
else{
MinMax(mn,mx,&tmn,&tmx);
if(N==2) return tmx-tmn;
ll A=(tmx-tmn+N-2)/(N-1);
mn=tmn;
vector<ll> V;
for(int i=0;i<N-1;i++){
MinMax(mn+A*i+i,mn+A*(i+1)+i,&tmn,&tmx);
V.push_back(tmn); V.push_back(tmx);
}
ll G=0;
for(int u=1;2*u<(int)V.size();u++) G=max(G,V[u*2]-V[u*2-1]);
return G;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 17 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5144 KB |
Output is correct |
| 19 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 21 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 22 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 23 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 24 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 25 |
Correct |
46 ms |
5144 KB |
Output is correct |
| 26 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 27 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 28 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 29 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 30 |
Correct |
36 ms |
5144 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
5288 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
5288 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
5288 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
5288 KB |
Output isn't correct |
| 15 |
Correct |
0 ms |
5288 KB |
Output is correct |
| 16 |
Incorrect |
23 ms |
6000 KB |
Output isn't correct |
| 17 |
Incorrect |
19 ms |
6000 KB |
Output isn't correct |
| 18 |
Incorrect |
13 ms |
6000 KB |
Output isn't correct |
| 19 |
Incorrect |
16 ms |
6000 KB |
Output isn't correct |
| 20 |
Incorrect |
6 ms |
6000 KB |
Output isn't correct |
| 21 |
Incorrect |
73 ms |
8304 KB |
Output isn't correct |
| 22 |
Incorrect |
83 ms |
8304 KB |
Output isn't correct |
| 23 |
Incorrect |
76 ms |
8304 KB |
Output isn't correct |
| 24 |
Incorrect |
79 ms |
8304 KB |
Output isn't correct |
| 25 |
Correct |
76 ms |
8304 KB |
Output is correct |
| 26 |
Incorrect |
69 ms |
8304 KB |
Output isn't correct |
| 27 |
Incorrect |
76 ms |
8304 KB |
Output isn't correct |
| 28 |
Incorrect |
86 ms |
8304 KB |
Output isn't correct |
| 29 |
Incorrect |
93 ms |
8304 KB |
Output isn't correct |
| 30 |
Incorrect |
36 ms |
8304 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
5144 KB |
Output isn't correct |
