# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680578 | Alexandruabcde | Gap (APIO16_gap) | C++14 | 67 ms | 3196 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
constexpr long long INF = 1LL * 1e18;
constexpr int NMAX = 1e5 + 2;
long long ans = 0;
long long A[NMAX];
void Solve_Task_1(int N) {
long long st = 1, dr = INF;
long long *Min, *Max;
Min = A + 1;
Max = A + N;
for (int i = 2; i <= N; i += 2) {
MinMax(st, dr, Min, Max);
st = (*Min) + 1;
dr = (*Max) - 1;
Min++;
Max--;
}
if (N % 2 == 1) {
MinMax(st, dr, A + (N+1) / 2, A + (N+1)/2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |