Submission #611979

#TimeUsernameProblemLanguageResultExecution timeMemory
611979chirathnirodhaThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define P push 
#define I insert 
#define F first 
#define S second

int find_best(int n) {
	int l=0,r=n-1;
	while(l<=r){
		int m=(l+r)/2;
		vector<int> res=ask(m);
		if(res[0]==0 && res[1]==0)return m;
		if(res[0]>0)r=m-1;
		else l=m+1;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...