Submission #1015961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015961		caterpillow	Brunhilda’s Birthday (BOI13_brunhilda)	C++17	3.33 / 100	145 ms	262144 KiB

brunhilda

#include <bits/stdc++.h>
 
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;
 
const int maxn = 1e7 + 1;
 
int m, qs; 
int dp[maxn];
vt<int> primes, ans;
vt<pi> queries;
vt<int> evs[maxn];
queue<pi> q;
 
main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> m >> qs;
    primes.resize(m);
    F0R (i, m) cin >> primes[i]; 
    for (int p : primes) {
        int x = p;
        while (x < maxn) {
            evs[x].pb(p);
            x += p;;
        }
    }
 
    queries.resize(qs);
    F0R (i, qs) cin >> queries[i].f, queries[i].s = i;
    sort(all(queries));
    reverse(all(queries));
    ans.resize(qs, -1);
 
    for (int p : primes) {
        q.push({0, p});
    }
 
    FOR (i, 1, maxn) {
        for (int p : evs[i]) {
            q.push({i, p});
        }
        while (q.front().f + q.front().s <= i) {
            q.pop();
        }
        if (q.front().f == i) break;
        dp[i] = dp[q.front().f] + 1;
        while (size(queries) && queries.back().f == i) {
            ans[queries.back().s] = dp[i];
            queries.pop_back();
        }
        if (!size(queries)) break;
    }
    F0R (i, qs) {
        if (ans[i] == -1) cout << "oo\n"; 
        else cout << ans[i] << endl;
    }
}

Compilation message (stderr)

brunhilda.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main() {
      | ^~~~

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