# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467009 | 2021-08-21T09:45:18 Z | nikolapesic2802 | popa (BOI18_popa) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "popa.h" using namespace std; int root; void sol(int i,int n,int* Left,int* Right) { if(i==n-1) return; if(query(i,i,i,i+1)){ Right[i]=i+1; solve(i+1,n,Left,Right); } else{ Left[i+1]=root; root=i+1; solve(i+1,n,Left,Right); } } int solve(int n,int* Left,int* Right) { for(int i=0;i<n;i++) { Left[i]=-1; Right[i]=-1; } root=-1; sol(0,n,Left,Right); return root; }