Submission #138433

#	Time	Username	Problem	Language	Result	Execution time	Memory
138433		silxikys	Brunhilda’s Birthday (BOI13_brunhilda)	C++14	5.87 / 100	841 ms	118688 KiB

brunhilda

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1e5+5, INF = 2e9+9;
int m, Q;

int dp[10000005];
int mxmod[20000005];

vector<int> primes;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> m >> Q;
    for (int i = 0; i < m; i++) {
        int p; cin >> p;
        primes.push_back(p);
    }
    sort(primes.begin(),primes.end());
    int maxPrime = primes.back();
    for (int i = 1; i < maxPrime; i++) {
        dp[i] = 1;
    }

    for (int p: primes) {
        for (int i = p; i <= 20000000; i += p) {
            mxmod[i-1] = max(mxmod[i-1],p-1);
        }
    }
    for (int i = 20000000; i >= maxPrime; i--) {
        if (mxmod[i] == 0) mxmod[i] = mxmod[i+1] - 1;
    }

    for (int i = maxPrime; i <= 10000000; i++) {
        dp[i] = INF;
        dp[i] = min(dp[i],1+dp[i-mxmod[i]]);
    }

    /*
    for (int i = 1; i <= 50; i++) {
        cout << i << ": " << dp[i] << '\n';
    }
    */

    while (Q--) {
        int qi; cin >> qi;
        if (dp[qi] == INF) cout << "oo\n";
        else cout << dp[qi] << '\n';
    }
}

• Subtask 1: 2.2222222222222223 / 20
• Subtask 2: 2.2222222222222223 / 20
• Subtask 3: 1.4285714285714286 / 60