Submission #313997

#	Time	Username	Problem	Language	Result	Execution time	Memory
313997		keta_tsimakuridze	The Big Prize (IOI17_prize)	C++14	20 / 100	51 ms	384 KiB

prize

#include "prize.h"
int l,r,mid,mx,ind,le,idx;
int find_best(int n) {
	for(int i = 0; i < 450; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
		if(mx<=res[0]+res[1]) mx=res[0]+res[1],ind=i,le=res[0];
	}
	while(true){
		int l=ind+1;
		int r=n-1;
		while(l<=r){
			int mid=(l+r)/2;
			std::vector<int> res= ask(mid);
			if(res[0]+res[1]==0) return mid;
			if(res[0]+res[1]==mx && le==res[0]) {
			l=mid+1;
			}else{
				if(res[0]+res[1]!=mx)idx=ind;
				r=mid-1;
			}
		}
		while(true){
			idx++;
			std::vector<int> res= ask(idx);
			if(res[0]+res[1]==mx){
			 ind=idx;le=res[0];break;}
			if(res[0]+res[1]==0) return idx;
		}
	}
	return 0;
}

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