Submission #548880

#	Time	Username	Problem	Language	Result	Execution time	Memory
548880		esomer	커다란 상품 (IOI17_prize)	C++17	20 / 100	1 ms	296 KiB

prize

#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

int find_best(int n) {
	int lo = 0;
	int hi = n - 1;
	while(lo <= hi){
		int mid = (lo + hi) / 2;
		vector<int> rep = ask(mid);
		if(rep[0] == 1){
			hi = mid - 1;
		}else if(rep[1] == 1){
			lo = mid + 1;
		}else{
			return mid;
		}
	}
	return -1;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80