Submission #1168448

#TimeUsernameProblemLanguageResultExecution timeMemory
1168448AgageldiGap (APIO16_gap)C++20
0 / 100
75 ms5796 KiB
#include "bits/stdc++.h" #include "gap.h" // #include "grader.cpp" using namespace std; #define ll long long ll n, l = 0, r = LLONG_MAX, mn = 0, mx = 0, answer, ans; set <ll> s; ll findGap(int T,int N) { while((int)s.size() < N && l <= r) { MinMax(l, r, &mn, &mx); if(mn == -1) break; s.insert(mn); s.insert(mx); l = mn + 1, r = mx; mn = mx = 0; } answer = 0, ans = *s.begin(); for(auto i : s) { answer = max(answer, i - ans); ans = i; } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...