#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);
//printf("%lld \n",blkSz);
long long ans=0;
long long left=mn;
long long a,b;
for (long long i=mn+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 |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
484 KB |
Output is correct |
| 3 |
Correct |
2 ms |
484 KB |
Output is correct |
| 4 |
Correct |
2 ms |
484 KB |
Output is correct |
| 5 |
Correct |
2 ms |
484 KB |
Output is correct |
| 6 |
Correct |
2 ms |
520 KB |
Output is correct |
| 7 |
Correct |
2 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
596 KB |
Output is correct |
| 9 |
Correct |
2 ms |
596 KB |
Output is correct |
| 10 |
Correct |
2 ms |
604 KB |
Output is correct |
| 11 |
Correct |
3 ms |
624 KB |
Output is correct |
| 12 |
Correct |
3 ms |
636 KB |
Output is correct |
| 13 |
Correct |
3 ms |
720 KB |
Output is correct |
| 14 |
Correct |
3 ms |
720 KB |
Output is correct |
| 15 |
Correct |
3 ms |
720 KB |
Output is correct |
| 16 |
Correct |
23 ms |
1112 KB |
Output is correct |
| 17 |
Correct |
19 ms |
1276 KB |
Output is correct |
| 18 |
Correct |
21 ms |
1276 KB |
Output is correct |
| 19 |
Correct |
25 ms |
1276 KB |
Output is correct |
| 20 |
Correct |
16 ms |
1276 KB |
Output is correct |
| 21 |
Correct |
90 ms |
2548 KB |
Output is correct |
| 22 |
Correct |
87 ms |
2576 KB |
Output is correct |
| 23 |
Correct |
87 ms |
2576 KB |
Output is correct |
| 24 |
Correct |
93 ms |
2576 KB |
Output is correct |
| 25 |
Correct |
69 ms |
2576 KB |
Output is correct |
| 26 |
Correct |
94 ms |
2576 KB |
Output is correct |
| 27 |
Correct |
91 ms |
2576 KB |
Output is correct |
| 28 |
Correct |
90 ms |
2576 KB |
Output is correct |
| 29 |
Correct |
93 ms |
2576 KB |
Output is correct |
| 30 |
Correct |
52 ms |
2576 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2576 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 10 |
Correct |
3 ms |
2576 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2576 KB |
Output is correct |
| 12 |
Correct |
4 ms |
2576 KB |
Output is correct |
| 13 |
Correct |
4 ms |
2576 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2576 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2576 KB |
Output is correct |
| 16 |
Correct |
23 ms |
2576 KB |
Output is correct |
| 17 |
Correct |
27 ms |
2576 KB |
Output is correct |
| 18 |
Correct |
29 ms |
2576 KB |
Output is correct |
| 19 |
Correct |
21 ms |
2576 KB |
Output is correct |
| 20 |
Partially correct |
15 ms |
2576 KB |
Partially correct |
| 21 |
Correct |
105 ms |
2576 KB |
Output is correct |
| 22 |
Correct |
83 ms |
2576 KB |
Output is correct |
| 23 |
Correct |
81 ms |
2576 KB |
Output is correct |
| 24 |
Correct |
114 ms |
2576 KB |
Output is correct |
| 25 |
Correct |
73 ms |
2576 KB |
Output is correct |
| 26 |
Correct |
95 ms |
2576 KB |
Output is correct |
| 27 |
Correct |
77 ms |
2576 KB |
Output is correct |
| 28 |
Correct |
81 ms |
2576 KB |
Output is correct |
| 29 |
Correct |
79 ms |
2576 KB |
Output is correct |
| 30 |
Partially correct |
59 ms |
2576 KB |
Partially correct |
| 31 |
Correct |
2 ms |
2576 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2576 KB |
Output is correct |
