제출 #1067277

#제출 시각아이디문제언어결과실행 시간메모리
1067277IgnutThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms428 KiB
// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> ask(int i);

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