Submission #1136641

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136641		steveonalex	Brunhilda’s Birthday (BOI13_brunhilda)	C++20	6.67 / 100	386 ms	118368 KiB

brunhilda

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
    
const int N = 1e7 + 69, INF = 1e9 + 69;

int e[N], idx[N];

void solve(){
    int n, q; cin >> n >> q;
    vector<int> p(n);
    for(int i = 0; i < n; ++i) cin >> p[i];

    for(int i = 0; i < N; ++i) idx[i] = 1;
    remove_dup(p); reverse(ALL(p));
    for(int i: p){
        for(int j = 0; j < N; j += i){
            idx[j] *= i;
            e[j] = i;
        }
    }

    vector<int> dp(N, INF);
    dp[0] = 0;
    int l = 0;
    for(int i = 1; i < N; ++i){
        while(l < i) {
            while(idx[l] > 1) {
                int u = e[idx[l]];
                if (l + u > i) break;
                idx[l] /= u;
            }
            if (idx[l] != 1) break;
            l++;
        }
        dp[i] = dp[l] + 1;
    }
    // for(int i = 0; i <= 10; ++i) cout << dp[i] << " ";
    // cout << "\n";

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

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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