제출 #566530

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

using namespace std;

int f(int l, int r){
	int m = (l+r)/2;
	vector<int> v = ask(m);
	if(v[0] == 0 && v[1] == 0)return m;
	if(l == r)return -1;
	if(v[1] > v[0]){
		int x = f(m+1,r);
		if(x != -1)return x;
	}
	return f(l,m-1);
}

int find_best(int n) {
	return f(0,n-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...