Submission #95581

#TimeUsernameProblemLanguageResultExecution timeMemory
95581jeffGap (APIO16_gap)C++14
44.60 / 100
188 ms1912 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { long long l, r, z, iv, ls = -1, rs = 0, a, b, i; MinMax(0, 1000000000000000000, &l, &r); z = l; iv = max((r - l) / N - 1, 1LL); for (i = 0; i < N * 2; ++i) { a = z + i * iv; b = z + (i + 1) * iv; MinMax(a, b, &l, &r); if (l < 0 && r < 0) continue; if (ls > -1) rs = max(rs, l - ls); ls = r; } return rs; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...