Submission #599130

#	Time	Username	Problem	Language	Result	Execution time	Memory
599130		pakhomovee	커다란 상품 (IOI17_prize)	C++17	20 / 100	5 ms	300 KiB

prize

#include "prize.h"
#include <vector>

int find_best(int n) {
    int pr = 0;
    int have = 0;
    while (pr != n) {
        int l = pr, r = n;
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (ask(m)[0] - have) {
                r = m;
            } else {
                l = m;
            }
        }
        std::vector<int> arr = ask(l);
        if (arr[0] == arr[1] && arr[0] == 0) {
            return l;
        }
        pr = l + 1;
        ++have;
    }
    return -1;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80