結果

問題 No.2318 Phys Bone Maker
コンテスト
ユーザー sten_san
提出日時 2023-05-26 22:32:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 817 ms / 3,000 ms
コード長 4,725 bytes
コンパイル時間 2,442 ms
コンパイル使用メモリ 216,852 KB
最終ジャッジ日時 2025-02-13 07:31:00
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int64_t n; cin >> n;

    auto prime_factor = [](int64_t n) {
        auto pf = vec<tuple<int64_t, int>>(uns, 0);

        for (int i = 2; i <= n / i; ++i) {
            if (n % i != 0) {
                continue;
            }

            int count = 0;
            while (n % i == 0) {
                ++count; n /= i;
            }

            pf.push_back({ i, count });
        }

        if (n != 1) {
            pf.push_back({ n, 1 });
        }

        return pf;
    };

    auto pf = prime_factor(n);

    auto prime_factor_ = [&](int64_t d) {
        auto pf_ = vec<tuple<int64_t, int>>(uns, 0);

        for (auto [p, _] : pf) {
            if (d % p != 0) {
                continue;
            }

            int c = 0;
            while (d % p == 0) {
                d /= p; ++c;
            }

            pf_.push_back({ p, c });
        }

        return pf_;
    };

    auto make_limit = [](const auto &pf) {
        auto limit = vec<int64_t>(uns, size(pf));
        for (size_t i = 0; i < size(pf); ++i) {
            auto [p, c] = pf[i]; limit[i] = 1;
            while (c--) {
                limit[i] *= p;
            }
        }
        return limit;
    };

    int log2 = 0;
    while ((INT64_C(1) << log2) <= n) {
        ++log2;
    }

    auto div = vec<int64_t>(uns, 0);
    for (int i = 1; i <= n / i; ++i) {
        if (n % i != 0) {
            continue;
        }
        div.push_back(i);
        div.push_back(n / i);
    }
    div = uniqued(sorted(move(div)));

    unordered_map<int64_t, mint> dp;

    dp[1] = 1;

    for (auto lcm : div) {
        if (lcm == 1) {
            continue;
        }

        auto pf = prime_factor_(lcm);
        auto limit = make_limit(pf);

        mint sum = 0;
        for (auto x : div) {
            if (lcm % x != 0 || lcm == x) {
                continue;
            }

            mint acc = 1;
            for (size_t i = 0; i < size(pf); ++i) {
                if (x % limit[i] == 0) {
                    acc *= get<1>(pf[i]) + 1;
                }
            }

            sum += dp[x] * acc;
        }

        dp[lcm] = sum;
    }

    cout << dp[n].val() << endl;
}
0