제출 #249297

#제출 시각아이디문제언어결과실행 시간메모리
249297sahil_kGap (APIO16_gap)C++14
0 / 100
56 ms1240 KiB
#include "gap.h" #include <iostream> #include <algorithm> using namespace std; long long findGap (int t, int n) { if (t == 1) { long long mn, mx; long long p_mn = 0, p_mx = 1e18; long long ans = 1e18; for (int i=0; i<(n+1)/2; i++) { MinMax(p_mn+1, p_mx-1, &mn, &mx); if (mn > -1) ans = min(ans, mn-p_mn); if (mx > -1) ans = min(ans, p_mx-mx); p_mn = mn; p_mx = mx; } return ans; } else { return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...