#585917 (C++17) No.1299 Random Array Score

提出ソース

結果

問題	No.1299 Random Array Score
ユーザー	scol_kp
提出日時	2020-11-27 23:17:42
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	26 ms / 2,000 ms
コード長	7,215 bytes
コンパイル時間	2,963 ms
コンパイル使用メモリ	202,268 KB
実行使用メモリ	4,688 KB
最終ジャッジ日時	2023-10-09 21:08:18
合計ジャッジ時間	4,463 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	24 ms 4,672 KB
testcase_04	AC	23 ms 4,656 KB
testcase_05	AC	18 ms 4,400 KB
testcase_06	AC	17 ms 4,376 KB
testcase_07	AC	18 ms 4,380 KB
testcase_08	AC	24 ms 4,664 KB
testcase_09	AC	3 ms 4,376 KB
testcase_10	AC	10 ms 4,380 KB
testcase_11	AC	4 ms 4,380 KB
testcase_12	AC	16 ms 4,376 KB
testcase_13	AC	23 ms 4,584 KB
testcase_14	AC	17 ms 4,376 KB
testcase_15	AC	17 ms 4,376 KB
testcase_16	AC	17 ms 4,376 KB
testcase_17	AC	4 ms 4,376 KB
testcase_18	AC	11 ms 4,376 KB
testcase_19	AC	13 ms 4,376 KB
testcase_20	AC	8 ms 4,376 KB
testcase_21	AC	2 ms 4,376 KB
testcase_22	AC	5 ms 4,376 KB
testcase_23	AC	16 ms 4,376 KB
testcase_24	AC	19 ms 4,380 KB
testcase_25	AC	17 ms 4,376 KB
testcase_26	AC	2 ms 4,380 KB
testcase_27	AC	5 ms 4,376 KB
testcase_28	AC	5 ms 4,376 KB
testcase_29	AC	6 ms 4,376 KB
testcase_30	AC	16 ms 4,376 KB
testcase_31	AC	7 ms 4,376 KB
testcase_32	AC	23 ms 4,668 KB
testcase_33	AC	26 ms 4,668 KB
testcase_34	AC	13 ms 4,568 KB
testcase_35	AC	26 ms 4,688 KB
testcase_36	AC	13 ms 4,620 KB

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

ソースコード

raw source code

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

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) { print(args...); }
        template <typename T>
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
        auto pmat(const T& mat, size_t h, size_t w) -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

template <std::int_fast64_t Modulus>
class ModInt {
    using i64 = std::int_fast64_t;

private:
    i64 m_value;

public:
    constexpr ModInt(const i64 x = 0) noexcept : m_value(x) {
        if (m_value < -Modulus || m_value >= Modulus) m_value %= Modulus;
        if (m_value < 0) m_value += Modulus;
    }

    constexpr i64 const& value() const noexcept { return m_value; }

    constexpr ModInt& operator+=(const ModInt rhs) noexcept {
        m_value += rhs.m_value;
        if (m_value >= Modulus) {
            m_value -= Modulus;
        }
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt rhs) noexcept {
        if (m_value < rhs.m_value) {
            m_value += Modulus;
        }
        m_value -= rhs.m_value;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt rhs) noexcept {
        m_value *= rhs.m_value;
        if (m_value >= Modulus) m_value %= Modulus;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt rhs) noexcept {
        *this *= rhs.inv();
        return *this;
    }

    constexpr ModInt& operator++() noexcept {
        *this += 1;
        return *this;
    }
    constexpr ModInt operator++(int) noexcept {
        ModInt res = *this;
        *this += 1;
        return res;
    }
    constexpr ModInt& operator--() noexcept {
        *this -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt res = *this;
        *this -= 1;
        return res;
    }

    constexpr ModInt inv() const noexcept {
        i64 q = m_value;
        i64 b = Modulus, u = 1, v = 0;
        i64 tmp = 0;
        while (b) {
            i64 t = q / b;
            q -= t * b;
            tmp = q, q = b, b = tmp;
            u -= t * v;
            tmp = u, u = v, v = tmp;
        }
        if (u < -Modulus || u >= Modulus) u %= Modulus;
        if (u < 0) u += Modulus;
        return u;
    }

    constexpr ModInt pow(i64 k) const noexcept {
        ModInt res = 1;
        ModInt tmp = 0;
        if (k < 0) {
            tmp = this->inv();
            k = -k;
        }
        else {
            tmp = *this;
        }
        for (; k > 0; k >>= 1) {
            if (k & 1) res *= tmp;
            tmp *= tmp;
        }
        return res;
    }

    friend constexpr ModInt operator+(const ModInt& a) noexcept {
        return a;
    }
    friend constexpr ModInt operator-(const ModInt& a) noexcept {
        return ModInt(0) - a;
    }
    friend constexpr ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) += rhs;
    }
    friend constexpr ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) -= rhs;
    }
    friend constexpr ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) *= rhs;
    }
    friend constexpr ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) /= rhs;
    }

    friend constexpr bool operator<(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value < rhs.m_value;
    }
    friend constexpr bool operator>(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value > rhs.m_value;
    }
    friend constexpr bool operator<=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value <= rhs.m_value;
    }
    friend constexpr bool operator>=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value >= rhs.m_value;
    }

    friend constexpr bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value == rhs.m_value;
    }
    friend constexpr bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value != rhs.m_value;
    }

    friend std::istream& operator>>(std::istream& is, ModInt& rhs) {
        i64 a;
        is >> a;
        rhs = a;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& rhs) {
        os << rhs.m_value;
        return os;
    }
};

constexpr long long MOD = 998244353;
using Mint = ModInt<MOD>;


void solve() {
    ll N, K;
    cin >> N >> K;
    vector<Mint> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    Mint sum = accumulate(A.begin(), A.end(), Mint(0));
    Mint y = (Mint(2).pow(K) - 1) / N;
    Mint ans = sum * (y * N + 1);
    prints()(ans);
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}

yukicoder

結果

テストケース

ソースコード