| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 436087 | Lam_lai_cuoc_doi | Gap (APIO16_gap) | C++17 | 68 ms | 2624 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>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr bool typetest = 0;
constexpr int N = 1e6 + 5;
#include "gap.h"
long long findGap(int t, int n)
{
if (t == 1)
{
vector<ll> a(n);
ll l = 0, r = 1e18;
for (int i = 0; i < (n + 1) / 2; ++i)
{
MinMax(l, r, &l, &r);
a[i] = l;
a[n - 1 - i] = r;
++l;
--r;
}
ll ans(0);
for (int i = 0; i < n - 1; ++i)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||