| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 526796 | ToroTN | Gap (APIO16_gap) | C++14 | 42 ms | 2020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"
long long t,n,st,ed,mn,mx,ans=-1e18;
vector<long long> l,r;
long long findGap(int T, int N)
{
t=(long long)T;
n=(long long)N;
if(t==1)
{
st=0;
ed=1e18;
for(int i=1;i<=(n-1)/2+1;i++)
{
//printf("%d\n",i);
MinMax(st,ed,&mn,&mx);
//printf("%lld %lld\n",mn,mx);
l.push_back(mn);
r.push_back(mx);
st=mn+1;
ed=mx-1;
}
/*for(int i=0;i<l.size();i++)
{
printf("%lld ",l[i]);
}
printf("\n");
for(int i=0;i<r.size();i++)
{
printf("%lld ",r[i]);
}
printf("\n");*/
for(int i=1;i<l.size();i++)
{
ans=max(ans,l[i]-l[i-1]);
}
ans=max(ans,r[r.size()-1]-l[l.size()-1]);
for(int i=r.size()-2;i>=0;i--)
{
ans=max(ans,r[i]-r[i+1]);
}
return ans;
}else
{
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
