제출 #1061415

#제출 시각아이디문제언어결과실행 시간메모리
1061415fv3커다란 상품 (IOI17_prize)C++14
20 / 100
1 ms344 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 c = (l + r) / 2;
		auto val = ask(c);

		if (!val[0] && !val[1])
			return c;

		if (val[0])
			r = c - 1;
		else
			l = c + 1;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...