Submission #1138197

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

using namespace std;

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

/*
8
3 2 3 1 3 3 2 3
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...