Submission #43933966

---

Source Code Expand

#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

// modint
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

#define poly vector<modint>
const modint G=3,Ginv=modint(1)/3;
inline poly one(){poly a;a.push_back(1);return a;}
vector<int>rev;
vector<modint>rts;
inline int ext(int n){
	int k=0;
	while((1<<k)<n)++k;return k; 
}
inline void init(int k){
	int n=1<<k;
	if(rev.size()==n)return;
	rev.resize(n);
	For(i,0,n-1)rev[i]=(rev[i>>1]>>1)|((i&1)<<(k-1));
	if(rts.size()>=n)return;
	int lst=max(1,(int)rts.size()); rts.resize(n);
	for(int mid=lst;mid<n;mid<<=1){
		modint wn=G^((mod-1)/(mid<<1));
		rts[mid]=1;
		For(i,1,mid-1)rts[i+mid]=rts[i+mid-1]*wn;
	}
}
void ntt(poly&a,int k,int typ)
{
	int n=1<<k;
	if(typ<0) reverse(a.begin()+1,a.end());
	For(i,0,n-1)if(i<rev[i])swap(a[i],a[rev[i]]); 
	for(int mid=1;mid<n;mid<<=1)
		for(int r=mid<<1,j=0;j<n;j+=r)
			for(int k=0;k<mid;++k){
				modint x=a[j+k],y=rts[mid+k]*a[j+k+mid];
				a[j+k]=x+y,a[j+k+mid]=x-y;
			}
	if(typ<0){
		modint inv=modint(1)/n;
		For(i,0,n-1)a[i]*=inv;
	}
}
 
poly operator +(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]+=b[i];return a;
}
poly operator -(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]-=b[i];return a;
}
poly operator *(poly a,modint b){
	int n=a.size();
	For(i,0,n-1)a[i]*=b;return a;
} 
poly operator *(poly a,poly b)
{
	if((int)a.size()<=64 && (int)b.size()<=64){
		poly c(a.size()+b.size()-1,0);
		for(int i=0;i<a.size();++i)
			for(int j=0;j<b.size();++j)
				c[i+j]+=a[i]*b[j];
		return c; 
	}
	int n=(int)a.size()+(int)b.size()-1,k=ext(n);
	a.resize(1<<k),b.resize(1<<k),init(k);
	ntt(a,k,1),ntt(b,k,1);
	For(i,0,(1<<k)-1)a[i]*=b[i];
	ntt(a,k,-1),a.resize(n);return a;
}

modint a[maxn];
poly tl[maxn<<2],tr[maxn<<2];
void init(int p,int l,int r)
{
	if(l==r){
		tl[p]={1,mod-1};
		tr[p]={1,1};
		return;
	}
	int mid=l+r>>1;
	init(p<<1,l,mid),init(p<<1|1,mid+1,r);
	tl[p]=tl[p<<1]*tl[p<<1|1];
	tr[p]=tr[p<<1]*tr[p<<1|1]; 
}

poly solve(int p,int l,int r)
{
	if(l==r)return {a[l]};
	int mid=l+r>>1;
	poly fl=solve(p<<1,l,mid),fr=solve(p<<1|1,mid+1,r);
	return fl*tr[p<<1|1]+fr*tl[p<<1];
}

void fwt(poly&f,int op)
{
	int n=f.size()-1;
	For(i,0,n)a[i]=f[i];
	f=solve(1,0,n);
	assert(f.size()==n+1);
	if(op!=1){
		modint iv=qpow((mod+1)/2,n);
		for(auto&x:f)x*=iv;
	}
}

int n,k;
signed main()
{
	n=read(),k=read();
	modint iv1e9=1; iv1e9/=1000000000;
	poly f(n+1),g(n+1);
	For(i,0,n)f[i]=read()*iv1e9;
	g[1]=1;
	init(1,0,n);
	fwt(f,1),fwt(g,1);
	For(i,0,n){
		modint tmpf=f[i]/C(n,i),tmpg=g[i]/C(n,i);
		tmpf=tmpf*(tmpg^k);
		f[i]=tmpf*C(n,i);
	}
	fwt(f,(mod+1)/2);
	For(i,0,n)cout<<f[i].x<<" ";
    return 0;
}

/*

*/

Submission Info

Compile Error

./Main.cpp: In function ‘int read()’:
./Main.cpp:11:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   11 |     if(f)x=-x;return x;
      |     ^~
./Main.cpp:11:15: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   11 |     if(f)x=-x;return x;
      |               ^~~~~~
./Main.cpp: In function ‘int ext(int)’:
./Main.cpp:77:2: warning: this ‘while’ clause does not guard... [-Wmisleading-indentation]
   77 |  while((1<<k)<n)++k;return k;
      |  ^~~~~
./Main.cpp:77:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘while’
   77 |  while((1<<k)<n)++k;return k;
      |                     ^~~~~~
./Main.cpp: In function ‘void init(int)’:
./Main.cpp:81:15: warning: comparison of integer expressions of different signedness: ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   81 |  if(rev.size()==n)return;
      |     ~~~~~~~~~~^~~
./Main.cpp:84:15: warning: comparison of integer expressions of different signedness: ‘std::vector<modint>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   84 |  if(rts.size()>=n)return;
      |     ~~~~~~~~~~^~~
./Main.cpp: In function ‘std::vector<modint> operator+(std::vector<modint>, std::vector<modint>)’:
./Main.cpp:2:20: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    2 | #define For(i,a,b) for(int i=(a);i<=(b);++i)
      |                    ^~~
./Main.cpp:111:2: note: in expansion of macro ‘For’
  111 |  For(i,0,n-1)a[i]+=b[i];return a;
      |  ^~~
./Main.cpp:111:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
  111 |  For(i,0,n-1)a[i]+=b[i];return a;
      |                         ^~~~~~
./Main.cpp: In function ‘std::vector<modint> operator-(std::vector<modint>, std::vector<modint>)’:
./Main.cpp:2:20: warning: this ‘for’ clause does not guard... [...

Judge Result