Submission #1184050

#TimeUsernameProblemLanguageResultExecution timeMemory
1184050alterioThe Big Prize (IOI17_prize)C++20
20 / 100
1 ms408 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()

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