# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134433 | thanos | 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<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-1,i+1,r)){
Left[i]=myway(l,i-1);
Right[i]=myway(i+1,r);
break;
}
}
return g;
}
int solve(int N,int* Left,int* Right){
for(int i=0; i<N; i++){
if(query(0,i-1,i+1,N-1)){
cout<<i;
break;
}
}
myway(0,N,Left,Right);
}