Submission #21852

#TimeUsernameProblemLanguageResultExecution timeMemory
21852mohammad_kilaniGap (APIO16_gap)C++14
30 / 100
126 ms12420 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; map<long long,bool> vis; vector<long long> v; long long findGap(int T, int N) { long long mn=0,mx=0; long long ans =0; long long s = 0 , e = 1e18; for(int i=0;i<(N+1)/2;i++){ MinMax(s,e,&mn,&mx); if(!vis[mn]) v.push_back(mn); vis[mn] = true; if(!vis[mx]) v.push_back(mx); vis[mx] = 1; s = mn+1; e = mx-1; } sort(v.begin(),v.end()); int si = v.size(); for(int i=0;i<si-1;i++){ ans = max(ans,v[i+1]-v[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...