Submission #814659

#TimeUsernameProblemLanguageResultExecution timeMemory
814659Dan4LifeThe Big Prize (IOI17_prize)C++17
20 / 100
52 ms336 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> v;

void query(int l, int r){
	if(l>r) return;
	if(l==r) { v.pb(l); return; }
	int mid = (l+r)/2;
	auto a = ask(mid);
	if(a[0]+a[1]==0) v.pb(mid);
	if(a[0]) query(l,mid-1);
	if(a[1]) query(mid+1,r);
}

int find_best(int n) {
	query(0,n-1);
	for(auto u : v){
		auto a = ask(u);
		if(a[0]+a[1]==0) return u;
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...