Submission #106944

#TimeUsernameProblemLanguageResultExecution timeMemory
106944maksim_gaponovGap (APIO16_gap)C++14
0 / 100
65 ms1276 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define int ll const int MAX = 1e18; int findGap(signed T, signed N) { // cout << T << ' ' << N << endl; int l = 0; int r = MAX; MinMax(l, r, &l, &r); int ans = 0; while (r != l) { if (r - l == 1) { ans = max(ans, r - l); break; } int nl; int nr; MinMax(l + 1, r - 1, &nl, &nr); if (nl != -1) { ans = max(ans, r - nr); ans = max(ans, nl - l); } else { ans = max(ans, r - l); } r = nr; l = nl; // cout << r << ' '; } // cout << endl; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...