結果

問題 No.2075 GCD Subsequence
ユーザー t98slidert98slider
提出日時 2022-09-16 22:57:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 687 ms / 4,000 ms
コード長 7,475 bytes
コンパイル時間 1,783 ms
コンパイル使用メモリ 175,736 KB
実行使用メモリ 64,168 KB
最終ジャッジ日時 2024-12-21 22:20:17
合計ジャッジ時間 19,835 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 394 ms
62,516 KB
testcase_01 AC 399 ms
62,520 KB
testcase_02 AC 402 ms
62,592 KB
testcase_03 AC 409 ms
62,464 KB
testcase_04 AC 389 ms
62,464 KB
testcase_05 AC 394 ms
62,464 KB
testcase_06 AC 400 ms
62,592 KB
testcase_07 AC 406 ms
62,592 KB
testcase_08 AC 476 ms
63,580 KB
testcase_09 AC 527 ms
64,000 KB
testcase_10 AC 482 ms
63,616 KB
testcase_11 AC 512 ms
63,848 KB
testcase_12 AC 494 ms
63,616 KB
testcase_13 AC 470 ms
63,480 KB
testcase_14 AC 509 ms
63,728 KB
testcase_15 AC 478 ms
63,360 KB
testcase_16 AC 476 ms
63,488 KB
testcase_17 AC 528 ms
64,056 KB
testcase_18 AC 670 ms
64,128 KB
testcase_19 AC 672 ms
64,128 KB
testcase_20 AC 667 ms
64,124 KB
testcase_21 AC 660 ms
64,128 KB
testcase_22 AC 669 ms
64,092 KB
testcase_23 AC 652 ms
64,168 KB
testcase_24 AC 670 ms
64,128 KB
testcase_25 AC 651 ms
64,064 KB
testcase_26 AC 687 ms
64,108 KB
testcase_27 AC 663 ms
64,064 KB
testcase_28 AC 678 ms
64,164 KB
testcase_29 AC 418 ms
62,464 KB
testcase_30 AC 407 ms
62,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

namespace internal {constexpr long long safe_mod(long long x, long long m) {x %= m;if (x < 0) x += m;return x;}struct barrett {unsigned int _m;unsigned long long im;explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}unsigned int umod() const { return _m; }};
constexpr long long pow_mod_constexpr(long long x, long long n, int m) {if (m == 1) return 0;unsigned int _m = (unsigned int)(m);unsigned long long r = 1;unsigned long long y = safe_mod(x, m);while (n) {if (n & 1) r = (r * y) % _m;y = (y * y) % _m;n >>= 1;}return r;}constexpr bool is_prime_constexpr(int n) {if (n <= 1) return false;if (n == 2 || n == 7 || n == 61) return true;if (n % 2 == 0) return false;long long d = n - 1;while (d % 2 == 0) d /= 2;constexpr long long bases[3] = {2, 7, 61};for (long long a : bases) {long long t = d;long long y = pow_mod_constexpr(a, t, n);while (t != n - 1 && y != 1 && y != n - 1) {y = y * y % n;t <<= 1;}if (y != n - 1 && t % 2 == 0) {return false;}}return true;}template <int n> constexpr bool is_prime = is_prime_constexpr(n);
constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {a = safe_mod(a, b);if (a == 0) return {b, 0};long long s = b, t = a;long long m0 = 0, m1 = 1;while (t) {long long u = s / t;s -= t * u;m0 -= m1 * u;auto tmp = s;s = t;t = tmp;tmp = m0;m0 = m1;m1 = tmp;}if (m0 < 0) m0 += b / s;return {s, m0};}constexpr int primitive_root_constexpr(int m) {if (m == 2) return 1;if (m == 167772161) return 3;if (m == 469762049) return 3;if (m == 754974721) return 11;if (m == 998244353) return 3;int divs[20] = {};divs[0] = 2;int cnt = 1;int x = (m - 1) / 2;while (x % 2 == 0) x /= 2;for (int i = 3; (long long)(i)*i <= x; i += 2) {if (x % i == 0) {divs[cnt++] = i;while (x % i == 0) {x /= i;}}}if (x > 1) {divs[cnt++] = x;}for (int g = 2;; g++) {bool ok = true;for (int i = 0; i < cnt; i++) {if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {ok = false;break;}}if (ok) return g;}}
template <int m> constexpr int primitive_root = primitive_root_constexpr(m);unsigned long long floor_sum_unsigned(unsigned long long n,unsigned long long m,unsigned long long a,unsigned long long b) {unsigned long long ans = 0;while (true) {if (a >= m) {ans += n * (n - 1) / 2 * (a / m);a %= m;}if (b >= m) {ans += n * (b / m);b %= m;}unsigned long long y_max = a * n + b;if (y_max < m) break;n = (unsigned long long)(y_max / m);b = (unsigned long long)(y_max % m);std::swap(m, a);}return ans;}
template <class T> using is_integral = typename std::is_integral<T>;template <class T>using is_signed_int =typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<is_integral<T>::value &&std::is_unsigned<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int<T>::value,std::make_unsigned<T>,std::common_type<T>>::type;template <class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;struct modint_base {};struct static_modint_base : modint_base {};template <class T> using is_modint = std::is_base_of<modint_base, T>;template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;}  // namespace internal
template <int m, std::enable_if_t<(1 <= m)>* = nullptr>
struct static_modint : internal::static_modint_base {using mint = static_modint;
    public:
    static constexpr int mod() { return m; }static mint raw(int v) {mint x;x._v = v;return x;}static_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>static_modint(T v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>static_modint(T v) {_v = (unsigned int)(v % umod());}unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}mint& operator*=(const mint& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {if (prime) {assert(_v);return pow(umod() - 2);} else {auto eg = internal::inv_gcd(_v, m);assert(eg.first == 1);return eg.second;}}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}friend istream& operator>>(istream& os,mint& rhs) noexcept {long long v;rhs = mint{(os >> v, v)};return os;}friend constexpr ostream& operator << (ostream &os, const mint& rhs) noexcept {return os << rhs._v;}
    private:
    unsigned int _v;static constexpr unsigned int umod() { return m; }static constexpr bool prime = internal::is_prime<m>;
};
using mint = static_modint<1000000007>;
using mint2 = static_modint<998244353>;

void debug(vector<mint2> dp){
    for(int i = 0; i < dp.size(); i++){
        cerr << dp[i] << (i + 1 == dp.size() ? '\n' : ' ');
    }
}

int main(){
    int n, v, r = 1000000;
    cin >> n;
    vector<vector<int>> y(r + 1);
    vector<int> a(n);
    for(auto &&v:a)cin >> v;
    vector<mint2> tb(r + 1);
    vector<mint2> dp(n, 1);
    mint2 ans;
    for(int i = 2; i <= r; i++){
        if(!y[i].empty())continue;
        for(int j = i; j <= r; j += i){
            y[j].push_back(i);
        }
    }
    /*vector<mint2> dp2(n, 1);
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(__gcd(a[i], a[j]) != 1)dp2[j] += dp2[i];
        }
    }*/
    for(int i = 0; i < n; i++){
        v = a[i];
        if(v == 1){
            ans++;
            continue;
        }
        for(int j = 1; j < (1 << y[v].size()); j++){
            int d = 1;
            for(int k = 0; k < y[v].size(); k++){
                if(j >> k & 1)d *= y[v][k];
            }
            dp[i] += (__builtin_popcount(j) & 1 ? tb[d] : -tb[d]);
        }
        ans += dp[i];
        for(int j = 1; j < (1 << y[v].size()); j++){
            int d = 1;
            for(int k = 0; k < y[v].size(); k++){
                if(j >> k & 1)d *= y[v][k];
            }
            tb[d] += dp[i];
        }
    }
    //debug(dp2);
    //debug(dp);
    //cerr << accumulate(dp2.begin(), dp2.end(), mint2(0)) << '\n';
    cout << ans << endl;
}
0