結果
問題 | No.1378 Flattening |
ユーザー |
|
提出日時 | 2021-02-05 22:55:19 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 120 ms / 2,000 ms |
コード長 | 3,462 bytes |
コンパイル時間 | 743 ms |
コンパイル使用メモリ | 81,368 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-02 13:42:48 |
合計ジャッジ時間 | 3,879 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 50 |
コンパイルメッセージ
a.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
ソースコード
#line 1 "a.cpp"#include<iostream>using namespace std;#line 3 "/home/kotatsugame/library/math/modint.cpp"#include<utility>template<int m>struct modint{unsigned int x;constexpr modint()noexcept:x(){}template<typename T>constexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}constexpr unsigned int val()const noexcept{return x;}constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}constexpr modint operator+()const noexcept{return*this;}constexpr modint operator-()const noexcept{return modint()-*this;}constexpr modint pow(long long n)const noexcept{if(n<0)return pow(-n).inv();modint x=*this,r=1;for(;n;x*=x,n>>=1)if(n&1)r*=x;return r;}constexpr modint inv()const noexcept{int s=x,t=m,x=1,u=0;while(t){int k=s/t;s-=k*t;swap(s,t);x-=k*u;swap(x,u);}return modint(x);}friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}friend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}friend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}};#line 4 "a.cpp"using mint=modint<998244353>;#line 1 "/home/kotatsugame/library/datastructure/DST.cpp"//Disjoint Sparse Table#include<vector>#include<functional>template<typename T>struct DST{function<T(T,T)>calcfn;int n;vector<vector<T> >dat;DST(const vector<T>&v={},function<T(T,T)>calcfn_=[](T a,T b){return a<b?a:b;}):calcfn(calcfn_){n=v.size();dat.push_back(v);for(int i=2;i<n;i<<=1){dat.push_back(vector<T>(n));for(int j=i;j<n;j+=i<<1){dat.back()[j-1]=dat[0][j-1];for(int k=2;k<=i;k++){dat.back()[j-k]=calcfn(dat[0][j-k],dat.back()[j-k+1]);}dat.back()[j]=dat[0][j];for(int k=2;k<=i&&j+k<=n;k++){dat.back()[j+k-1]=calcfn(dat.back()[j+k-2],dat[0][j+k-1]);}}}}T query(int l,int r)const//[l,r){if(l<0)l=0;if(r>n)r=n;r--;if(l==r)return dat[0][l];int k=31-__builtin_clz(l^r);return calcfn(dat[k][l],dat[k][r]);}};#line 6 "a.cpp"int N;int A[5050];mint dp[5050];main(){cin>>N;for(int i=0;i<N;i++)cin>>A[i];DST<int>P(vector<int>(A,A+N),[](int a,int b){return min(a,b);});dp[0]=1;for(int i=0;i<N;i++){mint S=0;for(int j=0;j<N;j++){S+=dp[j];if((j<=i?P.query(j,i+1):P.query(i,j+1))==A[j])dp[j]=S;else dp[j]=0;}}mint ans=0;for(int i=0;i<N;i++)ans+=dp[i];cout<<ans<<endl;}