Submission #283677

#TimeUsernameProblemLanguageResultExecution timeMemory
283677hank55663커다란 상품 (IOI17_prize)C++14
0 / 100
116 ms288 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;
		}
		else{
			Max=mid;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...