제출 #288959

#제출 시각아이디문제언어결과실행 시간메모리
288959JoMee커다란 상품 (IOI17_prize)C++17
20 / 100
50 ms384 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

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