Submission #52383

#	Time	Username	Problem	Language	Result	Execution time	Memory
52383		WLZ	The Big Prize (IOI17_prize)	C++17	20 / 100	72 ms	644 KiB

prize

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

int find_best(int n) {
    std::queue< std::pair<int, int> > q;
    std::vector<bool> asked(n, false);
    q.emplace(0, n - 1);
    while (!q.empty()) {
        std::pair<int, int> cur = q.front(); q.pop();
        int mid = (cur.first + cur.second) / 2;
        if (asked[mid]) continue;
        std::vector<int> v = ask(mid);
        asked[mid] = true;
        if (!v[0] && !v[1]) return mid;
        if (v[0] > v[1]) {
            if (v[0]) q.emplace(cur.first, mid - 1);
            if (v[1]) q.emplace(mid + 1, cur.second);
        } else {
            if (v[1]) q.emplace(mid + 1, cur.second);
            if (v[0]) q.emplace(cur.first, mid - 1);
        }
    }
	return 0;
}

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