結果
問題 | No.1294 マウンテン数列 |
ユーザー | kiyoshi0205 |
提出日時 | 2020-11-20 23:21:12 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,936 bytes |
コンパイル時間 | 3,602 ms |
コンパイル使用メモリ | 207,780 KB |
実行使用メモリ | 14,012 KB |
最終ジャッジ日時 | 2024-07-23 13:55:46 |
合計ジャッジ時間 | 8,114 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 3 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,944 KB |
testcase_10 | TLE | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair<ll,ll>; using ddatas=pair<double,double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) (v).erase(unique(all(v)),(v).end()) #define endl "\n" #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) // const ll mod=1000000007; const ll mod=998244353; const ll inf=1LL<<60; const double PI=acos(-1); const double eps=1e-9; template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";ll i; rep(i,v.size()){ if(i)os<<","; os<<v[i]; } os<<"}"; return os; } template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cerr<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cerr<<" "<<x;debugg(args...);} #define debug(...) cerr<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } double distance(ddatas x,ddatas y){ double a=x.first-y.first,b=x.second-y.second; return sqrt(a*a+b*b); } ll modinv(ll a,ll m=mod) { ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } ll moddevide(ll a,ll b){return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(ll n,ll r){ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1){ modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[i]=modinv(modncrlistp[i]); } } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n,ll m=mod){ ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} ll countdigits(ll n){ ll ans=0; while(n){n/=10;ans++;} return ans; } ll sumdigits(ll n){ ll ans=0; while(n){ans+=n%10;n/=10;} return ans; } template<typename T> struct segtree{ private: int N=1; T E; using func=function<T(T,T)>; func f,g; vector<T> tree; public: segtree(vector<T>& v,T e,func Merge,func Act):E(e),f(Merge),g(Act){ int i,K=v.size(); while(N<K)N<<=1; tree.resize(N<<1); For(i,N,N+K)tree[i]=v[i-N]; For(i,N+K,N<<1)tree[i]=E; brep1(i,N)tree[i]=f(tree[i<<1],tree[(i<<1)|1]); } segtree(vector<T>& v,T e,func Merge){*this=segtree(v,e,Merge,Merge);}; segtree(int N,T e,func F){ vector<T> res(N,e); *this=segtree(res,e,F); } void action(int i,T a){ if((i<0)|(i>=N))return; i+=N; tree[i]=g(tree[i],a); while(i>1){ i>>=1; tree[i]=f(tree[i<<1],tree[(i<<1)|1]); } } void input(int i,T a){ if((i<0)|(i>=N))return; tree[i+=N]=a; while(i>1){ i>>=1; tree[i]=f(tree[i<<1],tree[(i<<1)|1]); } } T queli(int a,int b){ if((a>=b)|(a<0)|(b<=0)|(a>=N)|(b>N))return E; T l(E),r(E); for(a+=N,b+=N;a<b;a>>=1,b>>=1){ if(a&1)l=f(l,tree[a++]); if(b&1)r=f(tree[--b],r); } return f(l,r); } }; template<typename T> struct LazySegmentTree{ private: using func=function<T(T,T)>; func f,g; size_t N=1; T E; vector<T> node,lazy; vector<bool> vis; void eval(size_t& x){ if(!vis[x])return; node[x]=g(node[x],lazy[x]); vis[x]=false; if(x<N){ if(vis[x<<1])lazy[x<<1]=g(lazy[x<<1],lazy[x]); else{ lazy[x<<1]=lazy[x]; vis[x<<1]=true; } if(vis[x<<1|1])lazy[x<<1|1]=g(lazy[x<<1|1],lazy[x]); else{ lazy[x<<1|1]=lazy[x]; vis[x<<1|1]=true; } } } void update(size_t& a,size_t& b,T& x,size_t now,size_t l,size_t r){ eval(now); if((b<=l)|(r<=a))return; if((a<=l)&(r<=b)){ vis[now]=true;lazy[now]=x; eval(now); }else{ update(a,b,x,now<<1,l,(l+r)>>1); update(a,b,x,now<<1|1,(l+r)>>1,r); node[now]=f(node[now<<1],node[now<<1|1]); } } T call(size_t& a,size_t &b,size_t now,size_t l,size_t r){ eval(now); if((b<=l)|(r<=a))return E; if((a<=l)&(r<=b))return node[now]; return f(call(a,b,now<<1,l,(l+r)>>1),call(a,b,now<<1|1,(l+r)>>1,r)); } public: LazySegmentTree(vector<T>& v,func F,func G,T Ie):f(F),g(G),E(Ie){ size_t i=v.size(); while(i){ N<<=1;i>>=1; } node.resize(N<<1,E); lazy.resize(N<<1); vis.resize(N<<1,false); for(i=0;i<v.size();i++){ node[N+i]=v[i]; } for(i=N;i--;){ node[i]=f(node[i<<1],node[i<<1|1]); } } //do g(p,x). p is all[a,b); void update(size_t a,size_t b,T x){ if(a<b)update(a,b,x,1,0,N); } //get f(I) I=[a,b); T get(size_t a,size_t b){ return call(a,b,1,0,N); } }; ll N,M,K,H,W,A,B,C,D; string s,t; ll ans; int main(){ startupcpp(); ll i,j; cin>>N; vec a(N); rep(i,N)cin>>a[i]; vec count(2500,0); a.eb(inf); vec firstdp(N+1,0); firstdp[0]=1; rep1(A,2500){ j=0; LazySegmentTree<ll> seg(firstdp,[](ll a,ll b){return (a+b)%mod;},[](ll a,ll b){return (a+b)%mod;},0); rep(i,N){ while(a[j]-a[i]<=A)++j; B=seg.get(i,i+1); seg.update(i+1,j,B); } count[A]=seg.get(N-1,N); // debug(A,count[A]); } debug(count); brep1(i,2500)(count[i]+=mod-count[i-1])%=mod; rep(i,2500)ans+=count[i]*i; debug(count); ans=ans*2%mod; print(ans); }