Submission #1054870

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054870		Unforgettablepl	커다란 상품 (IOI17_prize)	C++17	90 / 100	51 ms	5544 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n){
    vector<vector<int>> memo(n);
    auto askm = [&](int x) {
        if(!memo[x].empty())return memo[x];
        return memo[x]=ask(x);
    };
    int worst_case = 0;
    for(int i=0;i<480;i++) {
        auto curr = askm(i);
        int c = curr[0]+curr[1];
        if(c==0)return i;
        worst_case = max(worst_case,c);
    }
    for(int i=480;i<n;i++) {
        auto base = askm(i);
        if(base[0]+base[1]==worst_case)
            for(int jump=131072;jump;jump/=2) {
                if(i+jump>=n)continue;
                auto temp = askm(i+jump);
                if(temp==base)i+=jump;
            }
        int curr = base[0]+base[1];
        if(curr==0)return i;
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:6:31: warning: control reaches end of non-void function [-Wreturn-type]
    6 |     vector<vector<int>> memo(n);
      |                               ^

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