Submission #1084851

#TimeUsernameProblemLanguageResultExecution timeMemory
1084851TimoshGap (APIO16_gap)C++17
0 / 100
35 ms1776 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { long long l = 0, r = 1e18; vector<int> a, b; long long mn = 1, mx = 1; while (1) { MinMax(l, r, &mn, &mx); if (mn == -1) break; a.push_back(mn); b.push_back(mx); l = mn + 1, r = mx - 1; if (l > r) break; } int ans = 1; reverse(b.begin(), b.end()); int last = a[0]; for (auto &i : a) ans = max(ans, i - last), last = i; for (auto &i : b) ans = max(ans, i - last), last = i; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...