Submission #635546

#	Time	Username	Problem	Language	Result	Execution time	Memory
635546		Doncho_Bonboncho	The Big Prize (IOI17_prize)	C++14	0 / 100	83 ms	208 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>

int find_best(int n) {

	/*
	for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
	}
	*/


	int ans = -1;
	for( int i=0 ; i<n ; i++ ){
		std::vector<int> curr = ask(i);
		if( curr[0] + curr[1] >= n/2 ){
			int l = i, r = n-1;
			while( l != r-1 ){
				int m = ( l+r )/2;
				std::vector<int> mAsk = ask( m );
				if( mAsk[0] == curr[0] and mAsk[1] == mAsk[1] ) l = m;
				else r = m;
			}
			i = l+1;
		}else if( !curr[0] and !curr[1] ){ ans = i; break;};
	}

	return ans;
}

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