# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134514 | 2019-07-23T01:37:01 Z | thanos | popa (BOI18_popa) | C++14 | 0 ms | 0 KB |
#include<iostream> //#include<popa.h> using namespace std; int myway(int l,int r,int* Left,int* Right){ if(l>r) return -1; if(l==r){ Left[l]=-1; Right[l]=-1; return l; } int g=-1; for(int i=l; i<=r; i++){ if(query(l,i,i,r)==1){ Left[i]=myway(l,i-1,Left,Right); Right[i]=myway(i+1,r,Left,Right); g=i; break; } } return g; } int solve(int N,int* Left,int* Right){ int h=-1; for(int i=0; i<N; i++){ if(query(0,i,i,N-1)){ h=i; break; } } myway(0,N,Left,Right); return h; }