제출 #137298

#제출 시각아이디문제언어결과실행 시간메모리
137298Lawliet커다란 상품 (IOI17_prize)C++14
20 / 100
2 ms504 KiB
#include "prize.h"

using namespace std;

int find_best(int n) 
{
	int l = 0, r = n - 1;

	while(l < r)
	{
		int m = (l + r)/2;

		vector<int> aux = ask( m );

		if(aux[0] + aux[1] == 0)  return m;

		if(aux[0] == 1) r = m - 1;
		else l = m + 1; 
	}

	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...