Submission #1227576

#TimeUsernameProblemLanguageResultExecution timeMemory
1227576abdelhakimGap (APIO16_gap)C++20
59.02 / 100
46 ms3260 KiB
#include "gap.h" #include <bits/stdc++.h> #define dbg(x) cerr << #x << ' ' << x<< endl; #define ll long long using namespace std; long long findGap(int T, int N) { vector<ll> a; ll l=0; ll r=0; MinMax(0,1e18,&l,&r); if(N==2) return r-l; ll maxr=r; ll curl=l; ll sz=(((r-l-N+1)/(N-1))); while(curl<=maxr) { ll curr=min(maxr,curl+sz); MinMax(curl,curr,&l,&r); if(r!=-1) {a.push_back(l); a.push_back(r);} curl=curr+1; } ll ans=0; for (int i=1;i<a.size()-1;i++) { ans=max(ans,a[i]-a[i-1]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...