제출 #21850

#제출 시각아이디문제언어결과실행 시간메모리
21850mohammad_kilaniGap (APIO16_gap)C++14
0 / 100
139 ms12420 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; map<long long,bool> vis; long long findGap(int T, int N) { long long mn,mx; long long ans =1e18+2 ; vector<long long> v; 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;i++){ ans = min(ans,v[i+1]-v[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...