| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 483053 | Lam_lai_cuoc_doi | popa (BOI18_popa) | C++17 | 0 ms | 0 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 "popa.h"
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
void read(T &x)
{
x = 0;
register int c;
while ((c = getchar()) && (c > '9' || c < '0'))
;
for (; c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
}
constexpr bool typetest = 0;
constexpr int N = 1e3 + 5;
constexpr ll Inf = 1e17;
int l[N], r[N];
int solve(int left, int right)
{
vector<int> s;
for (int i = left; i <= right; ++i)
s.emplace_back(i);
shuffle(s.begin(), s.end(), rand);
int root = -1;
for (auto i : s)
if (query(i, i, left, right))
{
root = i;
break;
}
if (root > left)
l[root] = solve(left, root - 1);
if (root < right)
r[root] = solve(root + 1, right);
return root;
}
int solve(int n, int *Left, int *Right)
{
Left = l;
Right = r;
memset(l, -1, sizeof l);
memset(r, -1, sizeof r);
return solve(1, n);
}
void Read()
{
}
void Solve()
{
}