제출 #614095

#제출 시각아이디문제언어결과실행 시간메모리
614095sword060Gap (APIO16_gap)C++17
42.89 / 100
66 ms2244 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; vector<long long>a; long long rec(long long l,long long r,long long x){ if(l>r||x<=0)return 0; long long c,v; MinMax(l,r,&c,&v); if(c==-1)return 0; a.push_back(c);a.push_back(v); if(c==v||c==v-1)return 2; long long ret=2; ret+=rec(c+1,(c+v)/2,x-2)+2; ret+=rec((c+v)/2+1,v-1,x-2)+2; return ret; } long long findGap(int q,int x){ if(q==2)rec(0,1e18,x); else{ 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...