結果

問題 No.2625 Bouns Ai
ユーザー Today03
提出日時 2024-02-10 03:52:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 3,033 bytes
コンパイル時間 2,120 ms
コンパイル使用メモリ 199,596 KB
最終ジャッジ日時 2025-02-19 04:33:58
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#ifdef LOCAL
#include "./debug.cpp"
#else
#define debug(...)
#define print_line
#endif
using namespace std;
using ll = long long;

#include <iostream>

/**
 * @brief Modint
 */

template <long long MOD>
struct modint {
    long long value;
    modint(long long x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(long long x) const {
        modint ret(1), mul(value);
        while (x > 0) {
            if (x % 2 == 1) {
                ret *= mul;
            }
            mul *= mul;
            x /= 2;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend std::ostream &operator<<(std::ostream &os, const modint &x) {
        return os << x.value;
    }
    friend std::istream &operator>>(std::istream &is, modint &x) {
        long long v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;
using mint = mod998;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    A.insert(A.begin(), 0);

    const int MAX = 1e5;
    vector<vector<mint>> dp(N + 1, vector<mint>(MAX + 1, 0));
    dp[0][0] = 1;
    for (int i = 0; i < N; i++) {
        vector<mint> sum(MAX + 2);
        for (int j = 0; j <= MAX; j++) sum[j + 1] = sum[j] + dp[i][j];
        for (int j = 0; j + A[i + 1] <= MAX; j++) {
            int upper = min({MAX - A[i], j, j - A[i] + A[i + 1]});
            upper = max(upper, -1);
            dp[i + 1][j] += sum[upper + 1];
        }
    }

    mint ans = 0;
    for (int i = 0; i <= MAX; i++) ans += dp[N][i];
    cout << ans << endl;
}
0