結果
問題 | No.2625 Bouns Ai |
ユーザー |
|
提出日時 | 2024-02-09 22:15:03 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 423 ms / 2,000 ms |
コード長 | 2,526 bytes |
コンパイル時間 | 1,931 ms |
コンパイル使用メモリ | 208,240 KB |
実行使用メモリ | 161,664 KB |
最終ジャッジ日時 | 2024-09-28 15:31:07 |
合計ジャッジ時間 | 10,077 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <bits/stdc++.h>using namespace std;long long mod = 998244353;//入力が必ずmod未満の時に使う.struct mint{long long v = 0;mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}long long val(){return v;}void modu(){v %= mod;}mint repeat2mint(long long a,long long b){mint ret = 1,p = a; int Log = 60;if(b <= 2e9) Log = 30;for(int i=0; i<Log; i++){if(b&(1LL<<i)) ret *= p; p *= p;}return ret;};mint operator+(mint b){return (v+b.v)%mod;}mint operator-(mint b){return (v-b.v+mod)%mod;}mint operator*(mint b){return v*b.v%mod;}mint operator/(mint b){if(b.v == 0) assert(false);return v*(repeat2mint(b.v,mod-2)).v%mod;}void operator+=(mint b){v = (v+b.v)%mod;}void operator-=(mint b){v = (v-b.v+mod)%mod;}void operator*=(mint b){v = v*b.v%mod;}void operator/=(mint b){if(b.v == 0) assert(false);v = v*repeat2mint(b.v,mod-2).v%mod;}void operator++(int){v = (v+1)%mod; return;}void operator--(int){v = (v-1+mod)%mod; return;}bool operator==(mint b){if(v == b.v) return true; else return false;}bool operator!=(mint b){if(v != b.v) return true; else return false;}bool operator>(mint b){if(v > b.v) return true; else return false;}bool operator>=(mint b){if(v >= b.v) return true; else return false;}bool operator<(mint b){if(v < b.v) return true; else return false;}bool operator<=(mint b){if(v <= b.v) return true; else return false;}mint pow(long long x){return repeat2mint(v,x);}mint inv(){return mint(1)/v;}};int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int N; cin >> N;vector<int> A(N);for(auto &a : A) cin >> a;vector<vector<mint>> dp(N+1,vector<mint>(100001));dp.at(0).at(0) = 1;for(int i=0; i<N; i++){int a0 = 0,a1 = A.at(i);if(i) a0 = A.at(i-1);if(a1-a0 >= 0){mint sum = 0;for(int k=0; k<=100000-a1; k++){sum += dp.at(i).at(k);dp.at(i+1).at(k) = sum;}}else{int diff = a0-a1;mint sum = 0;for(int k=diff; k<=100000-a1; k++){sum += dp.at(i).at(k-diff);dp.at(i+1).at(k) = sum;}}}mint answer = 0;for(auto d : dp.back()) answer += d;cout << answer.v << endl;}