Submission #150938

#	Time	Username	Problem	Language	Result	Execution time	Memory
150938		dolphingarlic	Brunhilda’s Birthday (BOI13_brunhilda)	C++14	4.44 / 100	1084 ms	81064 KiB

brunhilda

#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MAXN 10000001
typedef long long ll;
using namespace std;

ll dp[MAXN];

int main() {
    iostream::sync_with_stdio(false);
    cin.tie(0);
    
    int n, q;
    cin >> n >> q;
    deque<pair<int, int>> dq;
    FOR(i, 0, n) {
        int k;
        cin >> k;
        dq.push_back({k, k});
    }

    dp[0] = 0;
    FOR(i, 1, MAXN) {
        dp[i] = INT_MAX;
        for (int j = 0; j < n && i == dq.front().first; j++) {
            int c, k;
            tie(c, k) = dq.front();
            dq.pop_front();
            while (c < dq.back().first) c += k;
            dq.push_back({c, k});
        }

        dp[i] = dp[i - (i % dq.front().second)] + 1;
    }

    FOR(i, 0, q) {
        int x;
        cin >> x;
        if (dp[x] >= INT_MAX) cout << "oo\n";
        else cout << dp[x] << '\n';
    }
    return 0;
}

Compilation message (stderr)

brunhilda.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")

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