Submission #104408

#TimeUsernameProblemLanguageResultExecution timeMemory
104408BadralThe Big Prize (IOI17_prize)C++17
0 / 100
3 ms532 KiB
#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
int can(int k) {
	vector<int> cer = ask(k);
	if(cer[0] == 0 && cer[1] == 0) 
		return 2;
	if(cer[0] == 1) return 0;
	return 1;
}

int find_best(int n) {
	int kk = 0;
	for(int i = n/2; i >= 1; i /= 2) {
		while(1) {
			int p = can(i+kk);
			if(p == 2) return (i+kk);
			if(p == 1 && kk+i <= n) {
				kk += i;
			}else break;
		}
	}
	return kk;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...