Submission #68201

#TimeUsernameProblemLanguageResultExecution timeMemory
68201gusfringGap (APIO16_gap)C++14
13.80 / 100
178 ms1532 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; typedef long long ll; const int MAXN = 1e5 + 5; const ll MAXA = 1000000000000000000LL; ll mn, mx; ll solve(ll lo, ll hi){ if(lo >= hi) return 0; unsigned long long x = (1LLU * lo + hi) / 2; ll mid = (ll)(x), mn1 = -1, mx1 = -1, mn2 = -1, mx2 = -1; if(lo < mid) MinMax(lo, mid, &mn1, &mx1); if(mid + 1 < hi) MinMax(mid + 1, hi, &mn2, &mx2); ll res = 0, r1 = 0, r2 = 0; if(mx1 != -1 && mx2 != -1) res = mn2 - mx1; if(mx2 != -1 && mx2 != mn2) r2 = solve(mn2, mx2); if(mx1 != -1 && mx1 != mn1) r1 = solve(mn1, mx1); return max({res, r1, r2}); } long long findGap(int T, int N){ MinMax(0, MAXA, &mn, &mx); return solve(mn, mx); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...