#558237 (C++17) No.1239 Multiplication -2

提出ソース

結果

問題	No.1239 Multiplication -2
ユーザー	kcvlex
提出日時	2020-09-25 22:20:44
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	24 ms / 2,000 ms
コード長	6,508 bytes
コンパイル時間	1,447 ms
コンパイル使用メモリ	147,164 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-28 06:43:24
合計ジャッジ時間	3,015 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	9 ms 6,940 KB
testcase_16	AC	14 ms 6,940 KB
testcase_17	AC	21 ms 6,944 KB
testcase_18	AC	21 ms 6,944 KB
testcase_19	AC	22 ms 6,944 KB
testcase_20	AC	23 ms 6,940 KB
testcase_21	AC	21 ms 6,940 KB
testcase_22	AC	21 ms 6,940 KB
testcase_23	AC	16 ms 6,940 KB
testcase_24	AC	16 ms 6,944 KB
testcase_25	AC	12 ms 6,940 KB
testcase_26	AC	14 ms 6,940 KB
testcase_27	AC	8 ms 6,944 KB
testcase_28	AC	21 ms 6,940 KB
testcase_29	AC	22 ms 6,940 KB
testcase_30	AC	11 ms 6,940 KB
testcase_31	AC	15 ms 6,940 KB
testcase_32	AC	24 ms 6,944 KB
testcase_33	AC	17 ms 6,944 KB
testcase_34	AC	16 ms 6,944 KB
testcase_35	AC	9 ms 6,944 KB
testcase_36	AC	8 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }



namespace math {

template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}


ll gcd(ll a, ll b) { return b ? gcd(a % b, b) : a; }

}

namespace math {

template <ll Mod>
struct Modint {

    constexpr Modint(ll x) noexcept : x(static_cast<ll>((Mod + x % Mod) % Mod)) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const noexcept { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const noexcept {
        return Modint<Mod>(1); 
    }
    
    constexpr ll value() const noexcept {
        return static_cast<ll>(x); 
    }

    constexpr Modint& operator+=(const Modint &oth) noexcept {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator-=(const Modint &oth) noexcept {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator*=(const Modint &oth) noexcept {
        x *= oth.value();
        x %= Mod;
        return *this;
    }

    constexpr Modint& operator/=(const Modint &oth) noexcept {
        x *= oth.inv().value();
        x %= Mod;
        return *this;
    }

    constexpr Modint operator+(const Modint &oth) const noexcept {
        return Modint(x) += oth;
    }

    constexpr Modint operator-(const Modint &oth) const noexcept {
        return Modint(x) -= oth;
    }

    constexpr Modint operator*(const Modint &oth) const noexcept {
        return Modint(x) *= oth;
    }

    constexpr Modint operator/(const Modint &oth) const noexcept {
        return Modint(x) /= oth;
    }

    constexpr Modint operator-() const noexcept {
        return Modint((x != 0) * (Mod - x)); 
    }

    constexpr bool operator==(const Modint &oth) const noexcept {
        return value() == oth.value();
    }

    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator=(T t) noexcept {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }

    constexpr Modint inv() const noexcept {
        return ::math::pow(*this, Mod - 2);
    }

    constexpr ll mod() const noexcept {
        return static_cast<ll>(Mod);
    }

private:
    ll x;
};

template <ll Mod>
Modint<Mod> inv(Modint<Mod> m) {
    m.inv();
    return m;
}

template <ll Mod>
std::istream& operator>>(std::istream &is, Modint<Mod> &m) {
    ll v;
    is >> v;
    m = v;
    return is;
}

template <ll Mod>
std::ostream& operator<<(std::ostream &os, Modint<Mod> m) {
    os << m.value();
    return os;
}

}

constexpr ll mod = 998244353;
using mint = math::Modint<mod>;
mint dp_buf1[5], dp_buf2[5];
mint *dp1 = dp_buf1 + 3;
mint *dp2 = dp_buf2 + 3;
    
int main() {
    ll n;
    std::cin >> n;
    mint ans = 0;
    vec<ll> av(n);
    for (ll &e : av) std::cin >> e;
    dp1[1] = 1;
    mint inv2 = mint(2).inv();
    
    for (ll i = 0; i < n; i++) {
        mint p1 = (i + 1 == n ? mint(1) : inv2);
        mint p2 = mint(1) - p1;
        for (ll j = -2; j <= 2; j++) {
            ll v = j * av[i];
            if (v == -2) ans += dp1[j] * p1;
            dp2[j] = 0;
        }

        for (ll j = -2; j <= 2; j++) {
            ll v = j * av[i];
            if (-2 <= v && v <= 2) dp2[v] += dp1[j] * p2;
        }
        dp2[1] += inv2;
        std::swap(dp1, dp2);
    }

    std::cout << ans << "\n";
    return 0;
}

yukicoder

結果

テストケース

ソースコード