Submission #116290

#	Time	Username	Problem	Language	Result	Execution time	Memory
116290		user202729	The Big Prize (IOI17_prize)	C++17	0 / 100	2 ms	388 KiB

prize

// https://oj.uz/problem/view/IOI17_prize
#include "prize.h"
#include<array>

// simple wrapper over ask
std::array<int,2> sk(int x){
	auto v=ask(x);
	return {{v[0],v[1]}};
}

int f(int l,std::array<int,2> lp,int r,std::array<int,2> rp){
	// return -1 if not found inside ]l..r[ , else index
	if(l+1==r)return -1;
	if(lp==rp)return -1; // [l] == [r], and no number > l or r in range
	int mid=(l+r)/2;
	auto mp=sk(mid);
	if(mp[0]+mp[1]==0)return mid;
	f(l,lp,mid,mp);
	f(mid,mp,r,rp);
}

int find_best(int n) {
	int l=0,r=n-1;
	auto lp=sk(l);
	if(lp[0]+lp[1]==0)return l;
	auto rp=sk(r);
	if(rp[0]+rp[1]==0)return r;
	f(l,lp,r,rp);
}

Compilation message (stderr)

prize.cpp: In function 'int f(int, std::array<int, 2>, int, std::array<int, 2>)':
prize.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
prize.cpp: In function 'int find_best(int)':
prize.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80