Submission #821311

#TimeUsernameProblemLanguageResultExecution timeMemory
821311vjudge1커다란 상품 (IOI17_prize)C++17
20 / 100
72 ms336 KiB
#include "prize.h"
using namespace std;

int ans, N, L, R;

void rec(int l, int r){
	if (L >= R || l > r || l < 0 || r >= N)
		return ;
	int mid = (l + r)/2;
	vector <int> q = ask(mid);
	if (q[0] == 0)
		L = mid;
	else{
		rec(max(l, L), mid - 1);
	}
	if (q[1] == 0)
		R = mid;
	else
		rec(mid + 1, min(R, r));
}

int find_best(int n) {
	N = n;
	L = -1;
	R = n;
	rec(0, n - 1);
	return L;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...