Submission #44327

#	Time	Username	Problem	Language	Result	Execution time	Memory
44327		neutron_byte	Brunhilda’s Birthday (BOI13_brunhilda)	C++17	0 / 100	3 ms	968 KiB

brunhilda

#include <bits/stdc++.h>
#define INF 1000000000
using namespace std;

const int n = 1000 * 1000 * 10;

int main() {
    int m, q, x;
    cin >> m >> q;

    int prime[m];
    for (int i = 0; i < m; ++i) {
        cin >> prime[i];
    }

    int dp[n + 1];
    dp[0] = 0;

    int updated[m];
    fill(updated, updated + m, 0);

    vector<int> current[n + 1];
    for (int i = 0; i < m; ++i) {
        if (prime[i] < 300) continue;
        for (int j = 0; prime[i] * j <= n; ++j) {
            current[prime[i] * j].push_back(i);
        }
    }

    for (int i = 1; i <= n; ++i) {
        for (int pIdx : current[i]) {
            updated[pIdx] = i;
        }

        for (int j = 0; j < m && prime[j] < 300; ++j) {
            if (i % prime[j] == 0) updated[j] = i;
        }

        int bestVal = INF;
        for (int j = 0; j < m; ++j) {
            bestVal = min(bestVal, updated[j]);
        }

        if (bestVal >= i) dp[i] = INF;
        else dp[i] = 1 + dp[bestVal];
    }

    while (q--) {
        cin >> x;
        cout << (dp[x] < INF ? to_string(dp[x]) : "oo") << endl;
    }

    return 0;
}

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