제출 #426692

#제출 시각아이디문제언어결과실행 시간메모리
426692Hazem커다란 상품 (IOI17_prize)C++14
20 / 100
78 ms320 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int find_best(int n) {

	vector<int>cur = ask(0);
	int idx = 0;
	if(!cur[0]&&!cur[1])
		return 0;

	while(1){
		
		int l = idx,r = n-1;
		while(l<r){
			int mid = (l+r+1)/2;
			if(ask(mid)==cur)l = mid;
			else r = mid-1;
		}
		cur = ask(l+1);
		idx = l+1;
		if(!cur[0]&&!cur[1])
			return idx;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...