제출 #125916

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

using namespace std;
int find_best(int n) {
	vector<int> v;
	int low=0;int hi=n,mid;
	while(hi-low>1){
		v.clear();
		mid=(low+hi)/2;
		v=ask(mid);
		if(v[0]==0 and v[1]==0){
			return mid;
			break;
		}
		if(v[0]<v[1]){
			low=mid;
		}
		else{
			hi=mid;
		}
	}
	return ((low+hi)/2);
}	
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...