# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
45844 |
2018-04-16T09:17:47 Z |
gnoor |
Gap (APIO16_gap) |
C++17 |
|
104 ms |
2652 KB |
#include "gap.h"
#include <cmath>
#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;
double blkSz=(double)(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 (double 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(floor(i),floor(i+blkSz-1),&a,&b);
if (a==-1) continue;
ans=max(ans,a-left);
left=b;
}
ans=max(ans,mx-left);
return ans;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
564 KB |
Output is correct |
4 |
Correct |
2 ms |
564 KB |
Output is correct |
5 |
Correct |
2 ms |
564 KB |
Output is correct |
6 |
Correct |
2 ms |
564 KB |
Output is correct |
7 |
Correct |
2 ms |
564 KB |
Output is correct |
8 |
Correct |
2 ms |
564 KB |
Output is correct |
9 |
Correct |
2 ms |
564 KB |
Output is correct |
10 |
Correct |
2 ms |
588 KB |
Output is correct |
11 |
Correct |
3 ms |
588 KB |
Output is correct |
12 |
Correct |
2 ms |
596 KB |
Output is correct |
13 |
Correct |
2 ms |
724 KB |
Output is correct |
14 |
Correct |
2 ms |
724 KB |
Output is correct |
15 |
Correct |
2 ms |
724 KB |
Output is correct |
16 |
Correct |
16 ms |
1088 KB |
Output is correct |
17 |
Correct |
17 ms |
1124 KB |
Output is correct |
18 |
Correct |
18 ms |
1208 KB |
Output is correct |
19 |
Correct |
18 ms |
1208 KB |
Output is correct |
20 |
Correct |
16 ms |
1208 KB |
Output is correct |
21 |
Correct |
64 ms |
2524 KB |
Output is correct |
22 |
Correct |
69 ms |
2652 KB |
Output is correct |
23 |
Correct |
76 ms |
2652 KB |
Output is correct |
24 |
Correct |
62 ms |
2652 KB |
Output is correct |
25 |
Correct |
56 ms |
2652 KB |
Output is correct |
26 |
Correct |
65 ms |
2652 KB |
Output is correct |
27 |
Correct |
68 ms |
2652 KB |
Output is correct |
28 |
Correct |
76 ms |
2652 KB |
Output is correct |
29 |
Correct |
65 ms |
2652 KB |
Output is correct |
30 |
Correct |
49 ms |
2652 KB |
Output is correct |
31 |
Correct |
2 ms |
2652 KB |
Output is correct |
32 |
Correct |
2 ms |
2652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2652 KB |
Output is correct |
2 |
Correct |
2 ms |
2652 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
2 ms |
2652 KB |
Output is correct |
5 |
Correct |
2 ms |
2652 KB |
Output is correct |
6 |
Correct |
2 ms |
2652 KB |
Output is correct |
7 |
Correct |
2 ms |
2652 KB |
Output is correct |
8 |
Correct |
2 ms |
2652 KB |
Output is correct |
9 |
Correct |
2 ms |
2652 KB |
Output is correct |
10 |
Correct |
2 ms |
2652 KB |
Output is correct |
11 |
Correct |
3 ms |
2652 KB |
Output is correct |
12 |
Correct |
3 ms |
2652 KB |
Output is correct |
13 |
Correct |
3 ms |
2652 KB |
Output is correct |
14 |
Correct |
3 ms |
2652 KB |
Output is correct |
15 |
Correct |
3 ms |
2652 KB |
Output is correct |
16 |
Correct |
19 ms |
2652 KB |
Output is correct |
17 |
Correct |
22 ms |
2652 KB |
Output is correct |
18 |
Correct |
20 ms |
2652 KB |
Output is correct |
19 |
Correct |
20 ms |
2652 KB |
Output is correct |
20 |
Correct |
10 ms |
2652 KB |
Output is correct |
21 |
Correct |
80 ms |
2652 KB |
Output is correct |
22 |
Correct |
77 ms |
2652 KB |
Output is correct |
23 |
Correct |
76 ms |
2652 KB |
Output is correct |
24 |
Correct |
77 ms |
2652 KB |
Output is correct |
25 |
Correct |
71 ms |
2652 KB |
Output is correct |
26 |
Correct |
80 ms |
2652 KB |
Output is correct |
27 |
Correct |
81 ms |
2652 KB |
Output is correct |
28 |
Correct |
104 ms |
2652 KB |
Output is correct |
29 |
Correct |
77 ms |
2652 KB |
Output is correct |
30 |
Correct |
39 ms |
2652 KB |
Output is correct |
31 |
Correct |
2 ms |
2652 KB |
Output is correct |
32 |
Correct |
2 ms |
2652 KB |
Output is correct |