제출 #426677

#제출 시각아이디문제언어결과실행 시간메모리
426677Hazem커다란 상품 (IOI17_prize)C++14
0 / 100
47 ms324 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)/2;
		vector<int>vec = ask(mid);
		if(!vec[0])l = mid;
		if(!vec[1])r = mid;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...