Submission #769949

#	Time	Username	Problem	Language	Result	Execution time	Memory
769949		APROHACK	The Big Prize (IOI17_prize)	C++14	20 / 100	1 ms	336 KiB

prize

#include "prize.h"

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second

using namespace std;

int find_best(int n) {
	int li = 0, ls = n-1, pos;
	pos = (li + ls)/2;
	while(li + 1 < ls){
		vector<int>ans = ask(pos);
		if(ans[0] > ans[1]){
			ls = pos-1;
		}else if(ans[1] > ans[0]){
			li = pos+1;
		}else{
			return pos;
		}
		pos = (li + ls)/2;
	}
	vector<int>ans = ask(pos);
	if(ans[0] + ans[1] == 0)return pos;
	else return pos + 1;
	return 0;
}

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