Submission #1271510

#TimeUsernameProblemLanguageResultExecution timeMemory
1271510cmiucGap (APIO16_gap)C++20
70 / 100
40 ms1096 KiB
#include <iostream> #include "gap.h" using namespace std; long long findGap(int t, int n){ long long Mn, Mx, A, B, inf = 1e18, lst; MinMax(0, inf, &Mn, &Mx); lst = Mn; long long Gap = (Mx - Mn + n - 2) / (n - 1); while (1){ MinMax(Mn + 1, Mn + Gap, &A, &B); if (A != -1){ Mn = Mn + Gap; Gap = max(Gap, A - lst); lst = B; } else Mn = Mn + Gap; if (B == Mx) break; } return Gap; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...