제출 #1247688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247688		arvindr9	Brunhilda’s Birthday (BOI13_brunhilda)	C++20	80.63 / 100	617 ms	235972 KiB

brunhilda

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
 
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define eb emplace_back
#define f first
#define s second
#define lep(i,a,b) for (int i = (a); i <= (b); i++)
#define rep(i,a,b) for (int i = (a); i >= (b); i--)
const int inf = 1e9;
int t;

const int mx = 1e7 + 5;
const int maxp = 5;
int prime_divs[mx+1][maxp];
int trans[mx+1];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vector<int> primes;
    lep(i,1,n) {
        int x;
        cin >> x;
        primes.pb(x);
    }
    for (int x: primes) {
        for (int i = x; i <= mx; i+=x) {
            lep(j,0,maxp-1) {
                if (prime_divs[i][j] == 0) {
                    prime_divs[i][j] = x;
                    break;
                }
            }
        }
    }
    // initialize trans[mx]
    for (int p: primes) {
        int val = mx;
        val = min(val, mx-(mx%p));
        trans[mx] = val;
    }
    rep(i,mx-1,0) {
        int val = trans[i+1];
        lep(j,0,maxp-1) {
            int p = prime_divs[i+1][j];
            if (p == 0) break;
            val = min(val, i-(i%p));
        }
        trans[i] = val;
    }
    trans[0] = 0;
    lep(i,1,mx) {
        trans[i] = (i == trans[i]) ? inf : trans[trans[i]]+1;
    }
    lep(qq,1,q) {
        int x; cin >> x;
        if (trans[x] == inf) {
            cout << "oo\n";
        } else {
            cout << trans[x] << "\n";
        }
    }
}

• Subtask 1: 17.7778 / 20
• Subtask 2: 20 / 20
• Subtask 3: 42.8571 / 60