Submission #1322006

#TimeUsernameProblemLanguageResultExecution timeMemory
1322006aaaaaaaaGap (APIO16_gap)C++20
9.12 / 100
68 ms5900 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; set<long long> x; int N; pair<long long, long long> ask(long long l, long long r){ long long *mn, *mx; MinMax(l, r, mn, mx); return {*mn, *mx}; } void solve(long long l, long long r){ if(l > r || (int) x.size() == N) return; long long mid = l + (r - l) / 2; long long mn, mx; MinMax(l, r, &mn, &mx); if(mn == -1 || mx == -1) return; x.insert(mn); x.insert(mx); if(l == r) return; solve(mn + 1, mid); solve(mid + 1, mx - 1); } long long findGap(int T, int n) { N = n; x.clear(); solve(0ll, (long long) 1e18); long long ans = 0ll, prev = *x.begin(); for(auto it : x){ ans = max(ans, it - prev); prev = it; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...