Submission #55046

#TimeUsernameProblemLanguageResultExecution timeMemory
55046adamczh1The Big Prize (IOI17_prize)C++17
20 / 100
60 ms556 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

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