제출 #553733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
553733		timreizin	커다란 상품 (IOI17_prize)	C++17	0 / 100	3058 ms	4944 KiB

prize

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

using namespace std;

int find_best(int n)
{
    vector<vector<int>> mem(n);
    int prev = -1;
    for (int i = 1;; ++i)
    {
        int l = 0, r = n;
        //first with left = >=i
        while (l < r)
        {
            int m = (l + r) >> 1;
            if (mem[m].empty()) mem[m] = ask(m);
            if (mem[m][0] + mem[m][1] == 0) return m;
            if (mem[m][0] < i || m <= prev || (n >= 1000 && mem[m][0] + mem[m][1] <= 30)) l = m + 1;
            else r = m;
        }
        prev = l - 1;
        if (mem[prev].empty()) mem[prev] = ask(prev);
        if (mem[prev][0] + mem[prev][1] == 0) return prev;
    }
}
//1 2 5 26 677 - mins
//1 4 21 446 200000 - maxs

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