結果

問題 No.1310 量子アニーリング
ユーザー ForestedForested
提出日時 2020-12-23 14:59:29
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 21 ms / 2,000 ms
コード長 4,656 bytes
コンパイル時間 1,994 ms
コンパイル使用メモリ 197,700 KB
最終ジャッジ日時 2025-01-17 06:24:46
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll infll = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << (i + 1 == vec_len ? "" : " ");
    }
    return os;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;

// Mod-Int
#include <iostream>
#include <type_traits>

template <unsigned int mod, std::enable_if_t<mod >= 1u && mod < (1u << 31)> * = nullptr>
struct ModInt {
    unsigned int val;
    
    ModInt() : val(0u) {}
    
    ModInt(long long x) : val(x < 0 ? x % mod + mod : (unsigned long long)x % mod) {}
    
    ModInt<mod> &operator+=(const ModInt<mod> &x) {
        val += x.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    
    ModInt<mod> &operator-=(const ModInt<mod> &x) {
        if (val < x.val) val += mod;
        val -= x.val;
        return *this;
    }
    
    ModInt<mod> &operator*=(const ModInt<mod> &x) {
        unsigned long long s = (unsigned long long)val * x.val;
        val = (unsigned int)(s % mod);
        return *this;
    }
    
    ModInt<mod> operator+() const {
        return *this;
    }
    
    ModInt<mod> operator-() const {
        return ModInt<mod>(0u) - *this;
    }
    
    friend ModInt<mod> operator+(const ModInt<mod> &x, const ModInt<mod> &y) {
        return ModInt<mod>(x) += y;
    }
    
    friend ModInt<mod> operator-(const ModInt<mod> &x, const ModInt<mod> &y) {
        return ModInt<mod>(x) -= y;
    }
    
    friend ModInt<mod> operator*(const ModInt<mod> &x, const ModInt<mod> &y) {
        return ModInt<mod>(x) *= y;
    }
    
    friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) {
        is >> x.val;
        // x.value %= mod;
        return is;
    }
    
    friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) {
        os << x.val;
        return os;
    }
    
    ModInt<mod> pow(unsigned long long x) const {
        ModInt<mod> res(1u), s(*this);
        while (x) {
            if (x & 1) res *= s;
            s *= s;
            x >>= 1;
        }
        return res;
    }
    
    // --- mod is prime ---
    ModInt<mod> &operator/=(const ModInt<mod> &x) {
        *this *= x.pow(mod - 2);
        return *this;
    }
    
    friend ModInt<mod> operator/(const ModInt<mod> &x, const ModInt<mod> &y) {
        return ModInt<mod>(x) /= y;
    }
};

// Conmibation
#include <vector>
#include <cassert>

template <unsigned int mod> // mod is prime
struct Combination {
    std::vector<ModInt<mod>> fact, inv_fact;
    
    Combination(std::size_t n) {
        resize(n);
    }
    
    void resize(std::size_t n) {
        std::size_t siz = fact.size();
        if (siz >= n + 1) return;
        fact.resize(n + 1);
        inv_fact.resize(n + 1);
        if (siz == 0) {
            fact[0] = inv_fact[0] = ModInt<mod>(1u);
            ++siz;
        }
        for (std::size_t i = siz; i <= n; ++i) {
            fact[i].val = fact[i - 1].val * (unsigned long long)i % mod;
        }
        inv_fact[n] = fact[n].pow(mod - 2);
        for (std::size_t i = n - 1; i >= siz; --i) {
            inv_fact[i].val = inv_fact[i + 1].val * (unsigned long long)(i + 1) % mod;
        }
    }
    
    ModInt<mod> operator()(int x, int y) const {
        if (y < 0 || y > x) return ModInt<mod>(0u);
        assert(x >= 0 && x < fact.size());
        return fact[x] * inv_fact[y] * inv_fact[x - y];
    }
};

// Main
constexpr unsigned int mod = 998244353;
using mint = ModInt<mod>;

int main() {
    int n;
    cin >> n;
    
    Combination<mod> comb(n);
    
    mint ans(0);
    rep(i, n / 2 + 1) {
        ans += comb(n, i * 2) * mint(2) * mint(2).pow(abs(n - 4 * i));
    }
    
    cout << ans << "\n";
}
0