Submission #1075749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075749		NeroZein	The Big Prize (IOI17_prize)	C++17	90 / 100	54 ms	600 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
 
int find_best(int n) {
	int mx = 0;
	for (int i = 0; i < n; ++i) {
		vector<int> res = ask(i); 
		if (res[0] + res[1] == 0) {
			return i; 
		}
		if (res[0] + res[1] < mx) {
			continue; 
		}
		mx = max(mx, res[0] + res[1]);
		
		int l = i, r = n - 1;
		while (l < r) {
			int mid = (l + r + 1) >> 1;
			vector<int> res2 = ask(mid);
			if (res2[1] < res[1] || res2[0] + res2[1] != res[0] + res[1]) {//I skipped a more valuable person
				r = mid - 1;
			} else {
				l = mid; 
			}
		}
		i = l;
	}
	assert(false);	
}

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