Submission #1241629

#TimeUsernameProblemLanguageResultExecution timeMemory
1241629SpyrosAlivThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

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