제출 #242156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242156		thecodingwizard	Brunhilda’s Birthday (BOI13_brunhilda)	C++11	6.67 / 100	297 ms	262148 KiB

brunhilda

#include <bits/stdc++.h>

using namespace std;

#define ii pair<int, int>
#define f first
#define s second

int A[100000]; 
int dp[10000001]; 
vector<int> transitions[10000001];

int main() {
    int m, q; cin >> m >> q;
    for (int i = 0; i < m; i++) cin >> A[i];
    for (int i = 0; i < 1000001; i++) dp[i] = -1;
    dp[0] = 0;

    int nxtStart = 0, nxtVal = 0;
    for (int i = 0; i < m; i++) {
        nxtVal = max(nxtVal, A[i]);

        transitions[A[i]].push_back(A[i]);
    }

    while (nxtStart != -1) {
        int begin = nxtStart, end = begin + nxtVal;
        nxtStart = -1;
        nxtVal = 0;

        end = min(end, 10000001);
        for (int i = begin + 1; i < end; i++) {
            for (int x : transitions[i]) {
                if (nxtStart+nxtVal < i + x) {
                    nxtStart = i;
                    nxtVal = x;
                }
                if (i+x<10000001) transitions[i+x].push_back(x);
            }
            transitions[i].clear();
            if (dp[i] == -1) dp[i] = dp[begin]+1;
        }
    }

    for (int i = 0; i < q; i++) {
        int x; cin >> x;
        if (dp[x] == -1) cout << "oo" << "\n";
        else cout << dp[x] << "\n";
    }

    return 0;
}

• Subtask 1: 6.666666666666667 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 60