제출 #1075484

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

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