Submit Info #3069

Problem Lang User Status Time Memory
Convolution (mod 1,000,000,007) cpp beet WA 651 ms 208.21 MiB

ケース詳細
Name Status Time Memory
example_00 AC 5 ms 0.64 MiB
example_01 AC 6 ms 0.67 MiB
fft_killer_00 WA 651 ms 208.18 MiB
fft_killer_01 AC 642 ms 208.18 MiB
max_random_00 AC 648 ms 208.21 MiB
max_random_01 WA 650 ms 208.21 MiB
medium_00 AC 14 ms 3.80 MiB
medium_01 AC 11 ms 2.30 MiB
medium_02 AC 14 ms 3.70 MiB
random_00 WA 595 ms 201.11 MiB
random_01 WA 610 ms 203.20 MiB
random_02 AC 300 ms 101.83 MiB
small_00 AC 5 ms 0.59 MiB
small_01 AC 5 ms 0.59 MiB
small_02 AC 7 ms 0.63 MiB
small_03 AC 6 ms 0.67 MiB
small_04 AC 6 ms 0.68 MiB
small_05 AC 6 ms 0.67 MiB
small_06 AC 5 ms 0.63 MiB
small_07 AC 5 ms 0.65 MiB
small_08 AC 7 ms 0.64 MiB
small_09 AC 6 ms 0.63 MiB
small_10 AC 4 ms 0.62 MiB
small_11 AC 7 ms 0.62 MiB
small_12 AC 5 ms 0.68 MiB
small_13 AC 5 ms 0.59 MiB
small_14 AC 6 ms 0.67 MiB
small_15 AC 4 ms 0.62 MiB

#define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_1000000007" #include<bits/stdc++.h> using namespace std; #define call_from_test #ifndef call_from_test #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE struct FastIO{ FastIO(){ cin.tie(0); ios::sync_with_stdio(0); } }fastio_beet; //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #ifndef call_from_test #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE template<typename T,T MOD = 1000000007> struct Mint{ 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 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;} 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> constexpr T Mint<T, MOD>::mod; 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 //INSERT ABOVE HERE signed ABC127_E(){ cin.tie(0); ios::sync_with_stdio(0); int h,w,k; cin>>h>>w>>k; using M = Mint<int>; M ans{0}; for(int d=1;d<h;d++) ans+=M(d)*M(h-d)*M(w)*M(w); for(int d=1;d<w;d++) ans+=M(d)*M(w-d)*M(h)*M(h); ans*=M::comb(h*w-2,k-2); cout<<ans<<endl; return 0; } /* verified on 2019/06/12 https://atcoder.jp/contests/abc127/tasks/abc127_e */ signed main(){ //ABC127_E(); return 0; } #endif #ifndef call_from_test #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../mod/mint.cpp" #undef call_from_test #endif //BEGIN CUT HERE constexpr int bmds(int x){ const int v[] = {1012924417, 924844033, 998244353, 897581057, 645922817}; return v[x]; } constexpr int brts(int x){ const int v[] = {5, 5, 3, 3, 3}; return v[x]; } template<int X> struct NTT{ static constexpr int md = bmds(X); static constexpr int rt = brts(X); using M = Mint<int, md>; vector< vector<M> > rts,rrts; void ensure_base(int n){ if((int)rts.size()>=n) return; rts.resize(n);rrts.resize(n); for(int i=1;i<n;i<<=1){ if(!rts[i].empty()) continue; M w=M(rt).pow((md-1)/(i<<1)); M rw=w.inv(); rts[i].resize(i);rrts[i].resize(i); rts[i][0]=M(1);rrts[i][0]=M(1); for(int k=1;k<i;k++){ rts[i][k]=rts[i][k-1]*w; rrts[i][k]=rrts[i][k-1]*rw; } } } void ntt(vector<M> &as,bool f){ int n=as.size(); assert((n&(n-1))==0); ensure_base(n); for(int i=0,j=1;j+1<n;j++){ for(int k=n>>1;k>(i^=k);k>>=1); if(i>j) swap(as[i],as[j]); } for(int i=1;i<n;i<<=1){ for(int j=0;j<n;j+=i*2){ for(int k=0;k<i;k++){ M z=as[i+j+k]*(f?rrts[i][k]:rts[i][k]); as[i+j+k]=as[j+k]-z; as[j+k]+=z; } } } if(f){ M tmp=M(n).inv(); for(int i=0;i<n;i++) as[i]*=tmp; } } vector<M> multiply(vector<M> as,vector<M> bs){ int need=as.size()+bs.size()-1; int sz=1; while(sz<need) sz<<=1; as.resize(sz,M(0)); bs.resize(sz,M(0)); ntt(as,0);ntt(bs,0); for(int i=0;i<sz;i++) as[i]*=bs[i]; ntt(as,1); as.resize(need); return as; } vector<int> multiply(vector<int> as,vector<int> bs){ vector<M> am(as.size()),bm(bs.size()); for(int i=0;i<(int)am.size();i++) am[i]=M(as[i]); for(int i=0;i<(int)bm.size();i++) bm[i]=M(bs[i]); vector<M> cm=multiply(am,bm); vector<int> cs(cm.size()); for(int i=0;i<(int)cs.size();i++) cs[i]=cm[i].v; return cs; } }; template<int X> constexpr int NTT<X>::md; template<int X> constexpr int NTT<X>::rt; //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #ifndef call_from_test #include<bits/stdc++.h> using namespace std; #define call_from_test #include "../mod/mint.cpp" #include "numbertheoretictransform.cpp" #undef call_from_test #endif //BEGIN CUT HERE struct Garner{ using ll = long long; static NTT<0> ntt0; static NTT<1> ntt1; static NTT<2> ntt2; static constexpr int pow(ll a,ll b,ll md){ ll res=1; a=a%md; while(b){ if(b&1) res=(ll)res*a%md; a=(ll)a*a%md; b>>=1; } return res; } static constexpr int inv(int x,int md){ return pow(x,md-2,md); } inline void garner(int &c0,int c1,int c2,int m01,int MOD){ static constexpr int r01=inv(ntt0.md,ntt1.md); static constexpr int r02=inv(ntt0.md,ntt2.md); static constexpr int r12=inv(ntt1.md,ntt2.md); c1=(ll)(c1-c0)*r01%ntt1.md; if(c1<0) c1+=ntt1.md; c2=(ll)(c2-c0)*r02%ntt2.md; c2=(ll)(c2-c1)*r12%ntt2.md; if(c2<0) c2+=ntt2.md; c0+=(ll)c1*ntt0.md%MOD; if(c0>=MOD) c0-=MOD; c0+=(ll)c2*m01%MOD; if(c0>=MOD) c0-=MOD; } inline void garner(vector< vector<int> > &cs,int MOD){ int m01 =(ll)ntt0.md*ntt1.md%MOD; int sz=cs[0].size(); for(int i=0;i<sz;i++) garner(cs[0][i],cs[1][i],cs[2][i],m01,MOD); } vector<int> multiply(vector<int> as,vector<int> bs,int MOD){ vector< vector<int> > cs(3); cs[0]=ntt0.multiply(as,bs); cs[1]=ntt1.multiply(as,bs); cs[2]=ntt2.multiply(as,bs); size_t sz=as.size()+bs.size()-1; for(auto& v:cs) v.resize(sz); garner(cs,MOD); return cs[0]; } template<typename T> decltype(auto) multiply(vector<T> am, vector<T> bm){ vector<int> as(am.size()),bs(bm.size()); for(int i=0;i<(int)as.size();i++) as[i]=am[i].v; for(int i=0;i<(int)bs.size();i++) bs[i]=bm[i].v; vector<int> cs=multiply(as,bs,T::mod); vector<T> cm(cs.size()); for(int i=0;i<(int)cm.size();i++) cm[i]=T(cs[i]); return cm; } }; NTT<0> Garner::ntt0; NTT<1> Garner::ntt1; NTT<2> Garner::ntt2; //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif #undef call_from_test signed main(){ int n,m; cin>>n>>m; vector<int> as(n),bs(m); for(int i=0;i<n;i++) cin>>as[i]; for(int i=0;i<m;i++) cin>>bs[i]; const int MOD = 1e9+7; Garner arb; auto cs=arb.multiply(as,bs,MOD); for(int i=0;i<(int)cs.size();i++){ if(i) cout<<" "; cout<<cs[i]; } cout<<endl; return 0; }