제출 #1060825

#제출 시각아이디문제언어결과실행 시간메모리
1060825ArthuroWich커다란 상품 (IOI17_prize)C++17
20 / 100
67 ms344 KiB
#include"prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
	vector<int> res;
	int l = 0, r = n-1;
	while(l < r) {
		int m = (l+r)/2;
		res = ask(m);
		if (res[0] == res[1] && res[0] == 0) {
			return m;
		} else if (res[0] < res[1]) {
			l = m+1;
		} else if (res[0] > res[1]) {
			r = m-1;
		}
	}
	for (int i = l; i <= min(r, n-1); i++) {
		res = ask(i);
		if (res[0] == res[1] && res[0] == 0) {
			return i;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...