Submission #41846

#TimeUsernameProblemLanguageResultExecution timeMemory
41846rahasiaThe Big Prize (IOI17_prize)C++14
20 / 100
30 ms2020 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int l,r,c,ma;
int find_best(int n) {
	for(int i = 0; i < n; i++) {
		std::vector<int> res = ask(i);
		if(res[0] + res[1] == 0)
			return i;
//		ma=max(ma,res[0]+res[1]);
//		if(res[0]+res[1]<ma)
//			continue;
		l=i+1;
		r=n-1;
		while(l<=r)
		{
			c=(l+r)/2;
			vector<int> hv=ask(c);
			if(hv==res)
			{
				i=c;
				l=c+1;
			}
			else
				r=c-1;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...