Submission #767644

#	Time	Username	Problem	Language	Result	Execution time	Memory
767644		SanguineChameleon	The Big Prize (IOI17_prize)	C++17	20 / 100	70 ms	296 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int cur = 0;
	while (true) {
		vector<int> res1 = ask(cur);
		if (res1[0] + res1[1] == 0) {
			return cur;
		}
		cur = cur + 1;
		int lt = cur + 1;
		int rt = n - 2;
		while (lt <= rt) {
			int mt = (lt + rt) / 2;
			vector<int> res2 = ask(mt);
			if (res2[0] + res2[1] == 0) {
				return mt;
			}
			if ((res2[0] + res2[1] < res1[0] + res1[1]) || ((res2[0] + res2[1] == res1[0] + res1[1]) && (res2[0] == res1[0]))) {
				cur = mt + 1;
				lt = mt + 1;
			}
			else {
				rt = mt - 1;
			}
		}
	}
	return -1;
}

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