Submission #758418

#TimeUsernameProblemLanguageResultExecution timeMemory
758418AndreyThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms336 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

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