제출 #1339066

#제출 시각아이디문제언어결과실행 시간메모리
1339066settopThe Big Prize (IOI17_prize)C++20
20 / 100
1 ms412 KiB
#include "prize.h"
#include<bits/stdc++.h>

using namespace std;

#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()

int find_best(int n){
	int ini=0,fim=n-1;
	while(ini<=fim){
		int mei=(ini+fim)>>1;
		auto v=ask(mei);
		if(v[0]+v[1]==0) return mei;
		if(v[0]) fim=mei-1;
		else ini=mei+1;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...