Submission #1195708

#TimeUsernameProblemLanguageResultExecution timeMemory
1195708madamadam3The Big Prize (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()

typedef long long ll;
using vi = vector<int>;
using vl = vector<ll>;

int find_best(int n) {
	int lo = 0, hi = n;
	while (lo <= hi) {
		int mid = lo + (hi - lo) / 2;
		vi res = ask(mid);

		// cout << "lo = " << lo << " hi = " << hi << " mid = " << mid << " r1 = " << res[0] << " r2 = " << res[1] << "\n";
		if (res[0] + res[1] == 0) {
			return mid;
		}

		if (res[0] == 1) {
			hi = mid;
		} else {
			lo = mid + 1;
		}
	}
	return lo;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...