Submission #61100

#TimeUsernameProblemLanguageResultExecution timeMemory
61100dukati8Gap (APIO16_gap)C++14
30 / 100
94 ms2568 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for (int i=a; i<int(b); i++) long long findGap(int T, int N) { if (T==1) { vector<long long> vals; long long hi=1e18; long long lo=0; long long ans1,ans2; rep (i,0,(N+1)/2) { assert(lo<=hi); MinMax(lo,hi,&ans1,&ans2); vals.push_back(ans1); vals.push_back(ans2); lo=ans1+1; hi=ans2-1; } sort(vals.begin(),vals.end()); long long maxdist=0; rep (i,0,vals.size()) { maxdist=max(maxdist,vals[i+1]-vals[i]); //cout << maxdist << endl; } return maxdist; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...