Submission #300671

#TimeUsernameProblemLanguageResultExecution timeMemory
300671JPN20The Big Prize (IOI17_prize)C++17
20 / 100
1 ms384 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

pair<int, int> query(int pos) {
	vector<int> vec = ask(pos);
	return make_pair(vec[0], vec[1]);
}

int find_best(int n) {
	int cl = 0, cr = n, cm;
	for (int i = 0; i < 20; i++) {
		cm = (cl + cr) / 2;
		pair<int, int> T = query(cm);
		if (T.first == 1) { cr = cm; }
		else if (T.second == 1) { cl = cm; }
		else { return cm; }
	}
	return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...