Submission #609511

#TimeUsernameProblemLanguageResultExecution timeMemory
609511sword060Gap (APIO16_gap)C++17
30 / 100
53 ms2260 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; vector<long long>a; long long findGap(int q,int x){ long long c=0,v=1e18,zz=x; while(zz&&c<=v){ long long l,r; MinMax(c,v,&l,&r); if(l==-1)break; a.push_back(l);if(l!=r)a.push_back(r); c=l+1;v=r-1;zz-=2; } sort(a.begin(),a.end()); long long ret=0; for(int i=0;i<(int)a.size()-1;i++)ret=max(ret,a[i+1]-a[i]); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...