Submission #134434

#	Time	Username	Problem	Language	Result	Execution time	Memory
134434		thanos	popa (BOI18_popa)	C++14	0 / 100	2 ms	376 KiB

popa

#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,Left,Right);
      Right[i]=myway(i+1,r,Left,Right);
      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);
}

Compilation message (stderr)

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:29:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39