Submission #108012

#TimeUsernameProblemLanguageResultExecution timeMemory
108012redaThe Big Prize (IOI17_prize)C++14
20 / 100
69 ms512 KiB
#include<bits/stdc++.h>
#include "prize.h"
 
using namespace std;
int find_best(int n)
{
  int  low , high;
  low =0; high=n-1;
  while(low<=high)
  {
    int mid=(low+high)/2;
    vector<int> arr=ask(mid);
    if(arr[0]==0 && arr[1]==0)return mid;
    else{
      if(arr[0])high=mid;
      else low=mid+1;
  }
  }
    return -1;
}
  
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...