Submission #108009

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