# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406903 | SeDunion | Gap (APIO16_gap) | C++17 | 30 ms | 1952 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 "gap.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve1(int N) {
ll L = -1, R = ll(1e18)+1;
vector<ll>a(N);
int l = 0, r = N - 1;
while (l <= r) {
ll *lq, *rq;
MinMax(L+1, R-1, lq, rq);
L = *lq, R = *rq;
a[l++] = L, a[r--] = R;
}
ll answer = 0;
for (int i = 0 ; i < N - 1 ; ++ i) answer = max(answer, a[i + 1] - a[i]);
return answer;
}
ll solve2(int N) {
return -1;
}
ll findGap(int T, int N) {
if (T == 1) {
return solve1(N);
} else {
return solve2(N);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |