제출 #405262

#제출 시각아이디문제언어결과실행 시간메모리
405262temurbek_khujaev커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms284 KiB
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int find_best(int n) {
    int l = 0;
    int r = n - 1;
    while (l <= r) {
        int m = (l + r) >> 1;
        vector<int> v = ask(m);
        int lc = v[0], rc = v[1];
        if (lc == 0 && rc == 0) return m;
        if (lc == 1) r = m - 1; else l = m + 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...