| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 30761 |
2017-07-26T12:13:19 Z |
aybala |
Gap (APIO16_gap) |
C++11 |
|
89 ms |
5144 KB |
#include "gap.h"
#include<bits/stdc++.h>
#define fori(a,b,c) for(int a=b; a<c; a++)
#define ford(a,b,c) for(int a=b; a>=c; a--)
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
long long findGap(int T, int N)
{
if(T==1){
ll lmn=-1, lmx=1000000000000000001;
ll ans=0;
fori(i,0,(N+1)/2){
ll mn,mx;
MinMax(lmn+1,lmx-1,&mn,&mx);
if(i!=0){
ans=max(ans,mn-lmn);
ans=max(ans,lmx-mx);
}
if(i==(N+1)/2-1){
ans=max(ans,mx-mn);
}
lmn=mn;
lmx=mx;
//cout << ans << " " << i << " " << endl;
}
return ans;
}
ll lmn=-1, lmx=1000000000000000001;
ll ans=0;
ll mn,mx;
MinMax(lmn+1,lmx-1,&mn,&mx);
lmn=mn;
lmx=mx;
if(N==2)
return mx-mn;
while(1){
if(lmn+ans>=lmx)
break;
while(1){
if(lmn+ans>=lmx)
break;
MinMax(lmn+1,lmn+ans+1,&mn,&mx);
if(mn!=-1){
ans=max(ans,mn-lmn);
lmn=mn;
}
else
break;
}
ll canans=ans+1;
while(1){
if(lmn+ans>=lmx){
break;
}
MinMax(lmn+canans,lmn+2*canans+1,&mn,&mx);
if(mn==-1){
canans*=2;
canans+=2;
}
else{
ans=max(ans,mn-lmn);
lmn=mx;
break;
}
}
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
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 |
9 ms |
5144 KB |
Output is correct |
| 18 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 19 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 20 |
Correct |
6 ms |
5144 KB |
Output is correct |
| 21 |
Correct |
46 ms |
5144 KB |
Output is correct |
| 22 |
Correct |
46 ms |
5144 KB |
Output is correct |
| 23 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 24 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 25 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 26 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 27 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 28 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 29 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 30 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 13 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 16 |
Partially correct |
16 ms |
5144 KB |
Partially correct |
| 17 |
Partially correct |
16 ms |
5144 KB |
Partially correct |
| 18 |
Partially correct |
19 ms |
5144 KB |
Partially correct |
| 19 |
Partially correct |
16 ms |
5144 KB |
Partially correct |
| 20 |
Correct |
6 ms |
5144 KB |
Output is correct |
| 21 |
Partially correct |
79 ms |
5144 KB |
Partially correct |
| 22 |
Partially correct |
83 ms |
5144 KB |
Partially correct |
| 23 |
Partially correct |
73 ms |
5144 KB |
Partially correct |
| 24 |
Partially correct |
79 ms |
5144 KB |
Partially correct |
| 25 |
Partially correct |
86 ms |
5144 KB |
Partially correct |
| 26 |
Partially correct |
86 ms |
5144 KB |
Partially correct |
| 27 |
Partially correct |
89 ms |
5144 KB |
Partially correct |
| 28 |
Partially correct |
76 ms |
5144 KB |
Partially correct |
| 29 |
Partially correct |
89 ms |
5144 KB |
Partially correct |
| 30 |
Correct |
36 ms |
5144 KB |
Output is correct |
| 31 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
