Submission #1241453

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

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

int find_best(int n) {
    int lo = 1, hi = n;
    while (true) {
        int mid = (lo + hi) / 2;

		vector<int> res = ask(mid);
		if(res[0] + res[1] == 0) return mid;

		if (res[0]) hi = mid - 1;
		else lo = mid + 1;
    }

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