Submission #1296690

#TimeUsernameProblemLanguageResultExecution timeMemory
1296690SamueleVidThe Big Prize (IOI17_prize)C++20
20 / 100
1 ms400 KiB
#include <bits/stdc++.h>
using namespace std;

vector<int> ask(int i);

int find_best(int n) {
    int l = 0, r = n;
    while(l!=r) {
        int m = (l+r)/2;
        auto v = ask(m);
        if(v[0]>0) r=m;
        else if (v[1]>0) l=m+1;
        else {l=m; r=m;}
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...