Submission #814590

#TimeUsernameProblemLanguageResultExecution timeMemory
814590Dan4LifeThe Big Prize (IOI17_prize)C++17
20 / 100
53 ms296 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int query(int l, int r){
	if(l>r) return 0;
	int mid = (l+r)/2;
	vector<int> a = ask(mid);
	int x = 0;
	if(a[0]+a[1]==0) return mid;
	if(a[0]) x=query(l,mid-1);
	if(!x and a[1]) x=query(mid+1,r);
	return x;
}

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