Submission #113520

#TimeUsernameProblemLanguageResultExecution timeMemory
113520E869120커다란 상품 (IOI17_prize)C++14
20 / 100
3 ms432 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int cl = 0, cr = n, cm;
	for (int i = 0; i < 22; i++) {
		cm = (cl + cr) / 2;
		vector<int> B = ask(cm);
		if (B[0] == 1) cr = cm;
		else cl = cm;
		if (B[0] + B[1] == 0) return cm;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...