Submission #296928

#TimeUsernameProblemLanguageResultExecution timeMemory
296928GurbanThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms288 KiB
#include <bits/stdc++.h>
#include "prize.h"
#define ff first
#define ss second
using namespace std;

int l,r,md,ans;

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