Submission #712330

#TimeUsernameProblemLanguageResultExecution timeMemory
712330josanneo22The Big Prize (IOI17_prize)C++17
0 / 100
1 ms288 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
	int l = 0, r = n - 1;
	while (l < r) {
		int md = (l + r) / 2;
		vector<int> tmp = ask(md);
		if (tmp[0] + tmp[1] == 0) {
			return md;
		}
		else if (tmp[0] == 0) {
			l = md + 1;
		}
		else r = md - 1;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...