Submission #1195797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195797		ezdp	The Big Prize (IOI17_prize)	C++20	20 / 100	23 ms	408 KiB

prize

#include "prize.h"

int find_best(int n){
	for(int l = 0; l < n; ){
		std::vector<int> cur = ask(l);
		if(cur[0] == 0 && cur[1] == 0) return l;
		int low = l, high = n, r = 0;
		while(low <= high){
			int mid = (low + high) / 2;
			std::vector<int> tmp = ask(mid);
			if(tmp[0] + tmp[1] != cur[0] + cur[1] || cur[0] != tmp[0]){
				high = mid - 1;
			}
			else{
				r = mid;
				low = mid + 1;
			}
		}
		l = r + 1;
	}
	return 0;
}

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