Submission #430086

#TimeUsernameProblemLanguageResultExecution timeMemory
430086moyindavidThe Big Prize (IOI17_prize)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h>
#include <prize.h>
using namespace std;

int find_best(int n){
    int l = 0, r = n-1;
    while(l<r)
    {
        int mid = (l+r)/2;
        vector<int> a; a.clear();
        a = ask(mid);
        if(a[0]==1) r = mid-1;
        else l = mid+1;
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...