oj.uz

Submission #134515

# Submission time Handle Problem Language Result Execution time Memory
134515 2019-07-23T01:37:21 Z thanos popa (BOI18_popa) C++14
0 / 100
 7 ms 376 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;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB invalid argument
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 248 KB invalid argument
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB invalid argument
2 Halted 0 ms 0 KB -