oj.uz

Submission #134488

# Submission time Handle Problem Language Result Execution time Memory
134488 2019-07-22T20:48:52 Z thanos popa (BOI18_popa) C++14
0 / 100
 9 ms 404 KB 
#include<iostream>
#include<popa.h>
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;
    }
  }
  return h;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 376 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 404 KB not a binary tree
2 Halted 0 ms 0 KB -