# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370550 | arnold518 | popa (BOI18_popa) | C++14 | 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 "popa.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N, *L, *R;
int qquery(int l1, int r1, int l2, int r2)
{
return query(l1-1, r1-1, l2-1, r2-1);
}
int f(int l, int r)
{
if(l==r) return l;
if(l>r) return -1;
for(int i=l; i<=r; i++)
{
if(qquery(l, r, i, i))
{
L[i-1]=f(l, i-1)-1;
R[i-1]=f(i+1, r)-1;
return i;
}
}
}
void solve(int _N, int *_L, int *_R)
{
N=_N; L=_L; R=_R;
return f(1, N)-1;
}