#include "gap.h"
#include <cstdio>
#ifdef debug
#include "grader.cpp"
#endif
#include <vector>
#include <algorithm>
using namespace std;
long long findGap(int T, int N)
{
if (T==1) {
vector<long long> tbl;
long long mn,mx;
long long left=0;
long long rgt=1e18;
int x=(N+1)/2;
for (int i=0;i<x;i++) {
MinMax(left,rgt,&mn,&mx);
tbl.push_back(mn);
if (mx!=mn) tbl.push_back(mx);
left=mn+1;
rgt=mx-1;
}
sort(tbl.begin(),tbl.end());
long long ans=0;
for (int i=1;i<N;i++) {
//printf("%lld ",tbl[i]);
ans=max(ans,tbl[i]-tbl[i-1]);
}
//printf("\n");
return ans;
} else {
long long mn,mx;
MinMax(0,1e18,&mn,&mx);
if (N==2) return mx-mn;
long long blkSz=(mx-mn-1)/(N-2);
long long over=mx-mn-1-(blkSz)*(N-2);
//printf("%lld \n",blkSz);
long long ans=0;
long long left=mn;
long long a,b;
//printf("%lld\n",over);
for (int i=0;i<over;i++) {
MinMax(mn+1+i*(blkSz+1),mn+(i+1)*(blkSz+1),&a,&b);
if (ans==-1) continue;
ans=max(ans,a-left);
left=b;
}
for (long long i=mn+1+over*(blkSz+1);i<mx;i+=blkSz) {
//if (i+2*blkSz-1>=mx) {
//MinMax(i,mx-1,&a,&b);
//if (a==-1) continue;
//ans=max(ans,a-left);
//left=b;
////continue;
//break;
//}
MinMax(i,min(i+blkSz-1,mx-1),&a,&b);
if (a==-1) continue;
ans=max(ans,a-left);
left=b;
}
ans=max(ans,mx-left);
return ans;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
364 KB |
Output is correct |
| 3 |
Correct |
2 ms |
428 KB |
Output is correct |
| 4 |
Correct |
3 ms |
480 KB |
Output is correct |
| 5 |
Correct |
2 ms |
612 KB |
Output is correct |
| 6 |
Correct |
2 ms |
632 KB |
Output is correct |
| 7 |
Correct |
2 ms |
632 KB |
Output is correct |
| 8 |
Correct |
2 ms |
632 KB |
Output is correct |
| 9 |
Correct |
2 ms |
632 KB |
Output is correct |
| 10 |
Correct |
2 ms |
676 KB |
Output is correct |
| 11 |
Correct |
3 ms |
680 KB |
Output is correct |
| 12 |
Correct |
3 ms |
680 KB |
Output is correct |
| 13 |
Correct |
3 ms |
680 KB |
Output is correct |
| 14 |
Correct |
3 ms |
680 KB |
Output is correct |
| 15 |
Correct |
2 ms |
680 KB |
Output is correct |
| 16 |
Correct |
24 ms |
1168 KB |
Output is correct |
| 17 |
Correct |
17 ms |
1168 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1168 KB |
Output is correct |
| 19 |
Correct |
16 ms |
1168 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1168 KB |
Output is correct |
| 21 |
Correct |
63 ms |
2464 KB |
Output is correct |
| 22 |
Correct |
64 ms |
2500 KB |
Output is correct |
| 23 |
Correct |
61 ms |
2500 KB |
Output is correct |
| 24 |
Correct |
69 ms |
2500 KB |
Output is correct |
| 25 |
Correct |
56 ms |
2500 KB |
Output is correct |
| 26 |
Correct |
69 ms |
2532 KB |
Output is correct |
| 27 |
Correct |
61 ms |
2660 KB |
Output is correct |
| 28 |
Correct |
61 ms |
2660 KB |
Output is correct |
| 29 |
Correct |
87 ms |
2660 KB |
Output is correct |
| 30 |
Correct |
53 ms |
2660 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2660 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2660 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2660 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 5 |
Correct |
2 ms |
2660 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2660 KB |
Output is correct |
| 7 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 11 |
Incorrect |
3 ms |
2660 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
2660 KB |
Output isn't correct |
| 13 |
Incorrect |
3 ms |
2660 KB |
Output isn't correct |
| 14 |
Incorrect |
4 ms |
2660 KB |
Output isn't correct |
| 15 |
Correct |
3 ms |
2660 KB |
Output is correct |
| 16 |
Incorrect |
20 ms |
2660 KB |
Output isn't correct |
| 17 |
Incorrect |
22 ms |
2660 KB |
Output isn't correct |
| 18 |
Incorrect |
25 ms |
2660 KB |
Output isn't correct |
| 19 |
Incorrect |
23 ms |
2660 KB |
Output isn't correct |
| 20 |
Incorrect |
15 ms |
2660 KB |
Output isn't correct |
| 21 |
Incorrect |
95 ms |
2660 KB |
Output isn't correct |
| 22 |
Incorrect |
74 ms |
2660 KB |
Output isn't correct |
| 23 |
Incorrect |
102 ms |
2660 KB |
Output isn't correct |
| 24 |
Incorrect |
92 ms |
2660 KB |
Output isn't correct |
| 25 |
Correct |
74 ms |
2660 KB |
Output is correct |
| 26 |
Incorrect |
77 ms |
2660 KB |
Output isn't correct |
| 27 |
Incorrect |
74 ms |
2660 KB |
Output isn't correct |
| 28 |
Incorrect |
82 ms |
2660 KB |
Output isn't correct |
| 29 |
Incorrect |
78 ms |
2660 KB |
Output isn't correct |
| 30 |
Incorrect |
66 ms |
2660 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
| 32 |
Incorrect |
2 ms |
2660 KB |
Output isn't correct |
