# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370552 | 2021-02-24T06:01:05 Z | arnold518 | popa (BOI18_popa) | C++14 | 0 ms | 0 KB |
#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 f(int l, int r) { if(l>r) return -1; if(l==r) return l; for(int i=l; i<=r; i++) { if(qquery(l, r, i, i)) { L[i]=f(l, i-1); R[i]=f(i+1, r); return i; } } } int solve(int _N, int *_L, int *_R) { N=_N; L=_L; R=_R; return f(0, N-1); }