Submission #1180991

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180991		HappyCapybara	The Big Prize (IOI17_prize)	C++17	100 / 100	11 ms	408 KiB

prize

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

int x;
map<int,int> m;

int solve(int l, int r, int ly, int ry){
	if (ly+ry == x || r < l) return -1;
	int mid = (l+r)/2;
	int fm = mid;
	vector<int> a;
	while (mid <= r){
		a = ask(mid);
		if (a[0]+a[1] == 0) return mid;
		if (a[0]+a[1] == x) break;
		mid++;
	}
	return max(solve(l, fm-1, ly, a[1]+(mid-fm)), solve(mid+1, r, a[0], ry));
}

int find_best(int n){
	int i = 0;
	while (i<500){
		vector<int> a = ask(i);
		if (a[0]+a[1] == 0) return i;
		m[a[0]+a[1]]++;
		i++;
		if (a[0]+a[1] > 50) break;
	}
	x = m.rbegin()->first;
	return solve(i, n-1, i-m[x], 0);
}

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