Submission #427038

#TimeUsernameProblemLanguageResultExecution timeMemory
427038Rouge_HugoThe Big Prize (IOI17_prize)C++14
0 / 100
1 ms320 KiB
#include<bits/stdc++.h>
#include "prize.h"
#define ll long long
#define fi first
#define se second
using namespace std;
int find_best(int n) {
    int l=0,r=n-1;
    while(l<r)
    {
        int m=(l+r)/2;
        vector<int>v=ask(m);
        if(v[0]==0)
            l=m+1;
        else r=m;
    }return l-1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...