제출 #553955

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

prize

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

using namespace std;

int find_best(int n)
{
    vector<vector<int>> mem(n);
    int prev = -1;
    mem[0] = ask(0);
    int sum = mem[0][0] + mem[0][1];
    if (sum == 0) return 0;
    for (int i = 1;; ++i)
    {
        int l = 0, r = n - 1;
        //first with not max level
        while (l < r)
        {
            int m = (l + r) >> 1;
            if (m <= prev)
            {
                l = m + 1;
                continue;
            }
            if (mem[m].empty()) mem[m] = ask(m);
            if (mem[m][0] + mem[m][1] == 0) return m;
            if (mem[m][0] + mem[m][1] > sum)
            {
                sum = mem[m][0] + mem[m][1];
                l = 0;
                r = n - 1;
                continue;
            }
            if ((mem[m][0] + mem[m][1] == sum && mem[m][0] < i) || m <= prev) l = m + 1;
            else r = m;
        }
        prev = l;
        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: 20 / 20
• Subtask 2: 80 / 80