This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
// verification-helper: PROBLEM https://yukicoder.me/problems/4271 #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../../mod/mint.cpp" #include "../../polynomial/recursivesequence.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); const char newl = '\n'; int k,n,m; cin>>k>>n>>m; using M = Mint<int>; vector<M> as(k),cs(k); for(int i=0;i<k;i++) cin>>as[i].v; for(int i=0;i<k;i++) cin>>cs[i].v; RecursiveSequence<M> rs(n); for(int i=0;i<m;i++){ int l,r; cin>>l>>r; rs.query(l,r); } auto ss=rs.build(as,cs); for(int i=0;i<n;i++) cout<<ss[i]<<newl; return 0; }
#line 1 "test/yukicoder/4271.test.cpp" // verification-helper: PROBLEM https://yukicoder.me/problems/4271 #include<bits/stdc++.h> using namespace std; #define call_from_test #line 1 "mod/mint.cpp" #line 3 "mod/mint.cpp" using namespace std; #endif //BEGIN CUT HERE template<typename T, T MOD = 1000000007> struct Mint{ inline static constexpr T mod = MOD; T v; Mint():v(0){} Mint(signed v):v(v){} Mint(long long t){v=t%MOD;if(v<0) v+=MOD;} Mint pow(long long k){ Mint res(1),tmp(v); while(k){ if(k&1) res*=tmp; tmp*=tmp; k>>=1; } return res; } static Mint add_identity(){return Mint(0);} static Mint mul_identity(){return Mint(1);} Mint inv(){return pow(MOD-2);} Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;} Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;} Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;} Mint& operator/=(Mint a){return (*this)*=a.inv();} Mint operator+(Mint a) const{return Mint(v)+=a;} Mint operator-(Mint a) const{return Mint(v)-=a;} Mint operator*(Mint a) const{return Mint(v)*=a;} Mint operator/(Mint a) const{return Mint(v)/=a;} Mint operator+() const{return *this;} Mint operator-() const{return v?Mint(MOD-v):Mint(v);} bool operator==(const Mint a)const{return v==a.v;} bool operator!=(const Mint a)const{return v!=a.v;} static Mint comb(long long n,int k){ Mint num(1),dom(1); for(int i=0;i<k;i++){ num*=Mint(n-i); dom*=Mint(i+1); } return num/dom; } }; template<typename T, T MOD> ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;} //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 1 "polynomial/recursivesequence.cpp" #line 3 "polynomial/recursivesequence.cpp" using namespace std; #endif //BEGIN CUT HERE // add recursive sequence template<typename T> struct RecursiveSequence{ vector<vector<int>> add,sub; RecursiveSequence(int n):add(n),sub(n+1){} // add a_0, ..., a_{r-l-1} to [l, r) void query(int l,int r){ add[l].emplace_back(0); sub[r].emplace_back(r-l); } // a_i = \sum_{k} c_k a_{i-k} vector<T> build(vector<T> as,vector<T> cs){ assert(as.size()==cs.size()); int n=add.size(); int k=as.size(); reverse(cs.begin(),cs.end()); as.resize(n+k); for(int i=0;i<n;i++) for(int j=0;j<k;j++) as[i+k]+=as[i+j]*cs[j]; vector<T> ss(n+k,T(0)); for(int i=0;i<n;i++){ for(int l:add[i]) for(int j=0;j<k;j++) ss[i+j]+=as[l+j]; for(int l:sub[i]) for(int j=0;j<k;j++) ss[i+j]-=as[l+j]; for(int j=0;j<k;j++) ss[i+k]+=ss[i+j]*cs[j]; } ss.resize(n); return ss; } }; //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #line 9 "test/yukicoder/4271.test.cpp" #undef call_from_test signed main(){ cin.tie(0); ios::sync_with_stdio(0); const char newl = '\n'; int k,n,m; cin>>k>>n>>m; using M = Mint<int>; vector<M> as(k),cs(k); for(int i=0;i<k;i++) cin>>as[i].v; for(int i=0;i<k;i++) cin>>cs[i].v; RecursiveSequence<M> rs(n); for(int i=0;i<m;i++){ int l,r; cin>>l>>r; rs.query(l,r); } auto ss=rs.build(as,cs); for(int i=0;i<n;i++) cout<<ss[i]<<newl; return 0; }