제출 #283678

#제출 시각아이디문제언어결과실행 시간메모리
283678hank55663커다란 상품 (IOI17_prize)C++14
20 / 100
1 ms384 KiB
#include "prize.h"
using namespace std;
int find_best(int n) {
	
	int Max=n-1,Min=0;
	while(Max>Min){
		int mid=(Max+Min)/2;
		vector<int> v=ask(mid);
		if(v[0]+v[1]==0){
			return mid;
		}
		if(v[0]<v[1]){
			Min=mid+1;
		}
		else{
			Max=mid-1;
		}
	}
	return Min;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...