Submission #745191

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7451912023-05-19 14:28:03viwlesxqGap (APIO16_gap)C++17
100 / 100
61 ms1956 KiB
#include "gap.h"
#include <bits/stdc++.h>
typedef long long ll;
ll Min, Max, s, t;
ll findGap(int T, int N) {
if (T == 1) {
s = 0, t = 1e18;
ll arr[N];
int l = 0, r = N - 1;
while (l <= r) {
MinMax(s, t, &Min, &Max);
arr[l] = Min, arr[r] = Max;
s = Min + 1, t = Max - 1;
l++, --r;
}
ll ans = 0;
for (int i = 1; i < N; ++i) {
ans = std::max(ans, arr[i] - arr[i - 1]);
}
return ans;
} else {
s = 0, t = 1e18;
MinMax(s, t, &Min, &Max);
ll step = (Max - Min + N - 2) / (N - 1);
ll l = Min, i, x, y, ans = step;
for (i = Min; i + step < Max; i += step + 1) {
MinMax(i, i + step, &x, &y);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...