Submission #1359730

#TimeUsernameProblemLanguageResultExecution timeMemory
1359730retarde커다란 상품 (IOI17_prize)C++20
0 / 100
0 ms412 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int lo = -1, hi = n - 1;
	while (hi > lo + 1) {
		int mid = (lo + hi) / 2;
		vector<int> q = ask(mid);
		if (q[0]) hi = mid;
		else lo = mid;
	}
	return lo;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...