Submission #1329429

#TimeUsernameProblemLanguageResultExecution timeMemory
1329429ezzzayThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms416 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
    int lo=0,hi=n-1;
    while(hi>=lo){
        int mid=(hi+lo)/2;
        std::vector<int> res = ask(mid);
        if(res[0]==1){
            hi=mid-1;
        }
        else lo=mid+1;
    }
    return hi;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...