제출 #1239560

#제출 시각아이디문제언어결과실행 시간메모리
1239560mychecksedad커다란 상품 (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
#define vi vector<int>

int find_best(int n) {
	int l = 0, r = n - 1;
	while(l <= r){
		int mid = l+r>>1;
		vi res = ask(mid);
		if(res[0] + res[1] == 0) return mid;
		if(res[0]){
			r = mid - 1;
		}else{
			l = mid + 1;
		}
	}

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...