結果
問題 | No.2625 Bouns Ai |
ユーザー |
|
提出日時 | 2024-02-09 22:12:52 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 301 ms / 2,000 ms |
コード長 | 3,535 bytes |
コンパイル時間 | 2,065 ms |
コンパイル使用メモリ | 175,112 KB |
実行使用メモリ | 318,712 KB |
最終ジャッジ日時 | 2024-09-28 15:28:51 |
合計ジャッジ時間 | 8,892 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include<bits/stdc++.h>using namespace std;using ll = long long;using pll = pair<ll, ll>;#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)#define rep(i, n) drep(i, 0, n - 1)#define all(a) (a).begin(), (a).end()#define pb push_back#define fi first#define se secondmt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());const ll MOD1000000007 = 1000000007;const ll MOD998244353 = 998244353;const ll MOD[3] = {999727999, 1070777777, 1000000007};const ll LINF = 1LL << 60LL;const int IINF = (1 << 30) - 1;template<long long mod>class modint{long long x;public:modint(long long x=0) : x((x%mod+mod)%mod) {}modint operator-() const {return modint(-x);}bool operator==(const modint& a){if(x == a) return true;else return false;}bool operator==(long long a){if(x == a) return true;else return false;}bool operator!=(const modint& a){if(x != a) return true;else return false;}bool operator!=(long long a){if(x != a) return true;else return false;}modint& operator+=(const modint& a) {if ((x += a.x) >= mod) x -= mod;return *this;}modint& operator-=(const modint& a) {if ((x += mod-a.x) >= mod) x -= mod;return *this;}modint& operator*=(const modint& a) {(x *= a.x) %= mod;return *this;}modint operator+(const modint& a) const {modint res(*this);return res+=a;}modint operator-(const modint& a) const {modint res(*this);return res-=a;}modint operator*(const modint& a) const {modint res(*this);return res*=a;}modint pow(long long t) const {if (!t) return 1;modint a = pow(t>>1);a *= a;if (t&1) a *= *this;return a;}// for prime modmodint inv() const {return pow(mod-2);}modint& operator/=(const modint& a) {return (*this) *= a.inv();}modint operator/(const modint& a) const {modint res(*this);return res/=a;}friend std::istream& operator>>(std::istream& is, modint& m) noexcept {is >> m.x;m.x %= mod;if (m.x < 0) m.x += mod;return is;}friend ostream& operator<<(ostream& os, const modint& m){os << m.x;return os;}};using mint = modint<MOD998244353>;void solve(){ll n; cin >> n;vector<ll> a(n+1, 0);for(ll i=1; i<=n; i++) cin >> a[i];ll MAX = 1e5;vector<vector<mint>> dp(n+1, vector<mint>(MAX+1, 0));vector<vector<mint>> sum(n+1, vector<mint>(MAX+1, 0));//初期化dp[0][0] = 1;sum[0][0] = 1;for(ll j=1; j<=MAX; j++) sum[0][j]=1;//遷移for(ll i=1; i<=n; i++){for(ll j=a[i]; j<=MAX; j++){ll l = a[i-1], r = min(j-a[i]+a[i-1], j);if(r<0) continue;if(r < l) continue;if(MAX<r) r = MAX;if(l>0){dp[i][j] = sum[i-1][r]-sum[i-1][l-1];}else{dp[i][j] = sum[i-1][r];}}sum[i][0] = dp[i][0];for(ll j=1; j<=MAX; j++) sum[i][j]=sum[i][j-1]+dp[i][j];}mint ans = 0;for(ll j=0; j<=MAX; j++) ans += dp[n][j];cout << ans << '\n';}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);int T=1;//cin >> T;while(T--) solve();}