QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#97783 | #6323. Range NEQ | Crysfly# | AC ✓ | 125ms | 28884kb | C++17 | 6.2kb | 2023-04-18 14:42:10 | 2023-04-18 14:42:11 |
Judging History
answer
#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)
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;
}
#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 pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
#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(!a.size()||!b.size())return {};
if((int)a.size()<=32 || (int)b.size()<=32){
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;
}
poly Tmp;
poly pmul(poly a,poly b,int n,bool ok=0)
{
int k=ext(n); init(k);
a.resize(1<<k),ntt(a,k,1);
if(!ok) b.resize(1<<k),ntt(b,k,1),Tmp=b;
For(i,0,(1<<k)-1)a[i]*=Tmp[i];
ntt(a,k,-1),a.resize(n);
return a;
}
poly inv(poly a,int n)
{
a.resize(n);
if(n==1){
poly f(1,1/a[0]);
return f;
}
poly f0=inv(a,(n+1)>>1),f=f0;
poly now=pmul(a,f0,n,0);
for(int i=0;i<f0.size();++i)now[i]=0;
now=pmul(now,poly(0),n,1);
f.resize(n);
for(int i=f0.size();i<n;++i)f[i]=-now[i];
return f;
}
poly inv(poly a){return inv(a,a.size());}
poly deriv(poly a){
int n=(int)a.size()-1;
For(i,0,n-1)a[i]=a[i+1]*(i+1);
a.resize(n);return a;
}
poly inter(poly a){
int n=a.size()+1;a.resize(n);
Rep(i,n-1,1)a[i]=a[i-1]/i;
a[0]=0;return a;
}
poly ln(poly a){
int n=a.size();
a=inter(deriv(a)*inv(a));
a.resize(n);return a;
}
poly exp(poly a,int k){
int n=1<<k;a.resize(n);
if(n==1)return one();
poly f0=exp(a,k-1);f0.resize(n);
return f0*(one()+a-ln(f0));
}
poly exp(poly a){
int n=a.size();
a=exp(a,ext(n));a.resize(n);return a;
}
poly div(poly a,poly b){
int n=a.size(),m=b.size(),k=ext(n-m+1);
reverse(a.begin(),a.end()),reverse(b.begin(),b.end());
a.resize(n-m+1),b.resize(n-m+1);
a=a*inv(b),a.resize(n-m+1),reverse(a.begin(),a.end()); return a;
}
poly modulo(poly a,poly b){
if(b.size()>a.size())return a;
int n=b.size()-1;
a=a-div(a,b)*b;a.resize(n);return a;
}
poly valF;
vector<poly>solveE(int l,int r){
if(l==r)return {{valF[l]},{1,(mod-l)%mod}};
int mid=l+r>>1;
auto fl=solveE(l,mid),fr=solveE(mid+1,r);
return {fl[0]*fr[1]+fl[1]*fr[0],fl[1]*fr[1]};
}
poly transE(poly f){
int n=f.size();valF=f;
vector<poly>g=solveE(0,n-1);
poly res=g[0]*inv(g[1]); res.resize(n);
For(i,0,n-1)res[i]*=ifac[i];
return res;
}
poly shift(poly f,modint v){
int n=f.size(); poly g(n); initC(n);
For(i,0,n-1)f[i]*=fac[i];
modint pw=1;
For(i,0,n-1)g[i]=ifac[i]*pw,pw*=v;
reverse(f.begin(),f.end()),f=f*g,reverse(f.begin(),f.end());
f.resize(n);
For(i,0,n-1)f[i]*=ifac[i];
return f;
}
poly mult(poly a,poly b){
int n=a.size();
reverse(a.begin(),a.end());
a=a*b,a.resize(n);reverse(a.begin(),a.end());return a;
}
#define maxn 200005
#define inf 0x3f3f3f3f
int n,m;
signed main()
{
n=read(),m=read();
initC(n*m+1);
n*=m;
poly f(n+1);
For(i,0,m) f[i]=C(m,i)*C(m,i)*fac[i]*sign(i);
int k=ext(n+1);
f.resize(1<<k),init(k),ntt(f,k,1);
For(i,0,(1<<k)-1)f[i]=qpow(f[i],n/m);
ntt(f,k,-1);
modint res=0;
For(i,0,n)res+=f[i]*fac[n-i];
cout<<res.x;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3400kb
input:
2 2
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3312kb
input:
5 1
output:
44
result:
ok 1 number(s): "44"
Test #3:
score: 0
Accepted
time: 3ms
memory: 3684kb
input:
167 91
output:
284830080
result:
ok 1 number(s): "284830080"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3404kb
input:
2 1
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 2ms
memory: 3404kb
input:
2 3
output:
36
result:
ok 1 number(s): "36"
Test #6:
score: 0
Accepted
time: 2ms
memory: 3308kb
input:
2 4
output:
576
result:
ok 1 number(s): "576"
Test #7:
score: 0
Accepted
time: 2ms
memory: 3304kb
input:
3 1
output:
2
result:
ok 1 number(s): "2"
Test #8:
score: 0
Accepted
time: 2ms
memory: 3460kb
input:
3 2
output:
80
result:
ok 1 number(s): "80"
Test #9:
score: 0
Accepted
time: 2ms
memory: 3352kb
input:
3 3
output:
12096
result:
ok 1 number(s): "12096"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3316kb
input:
3 4
output:
4783104
result:
ok 1 number(s): "4783104"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3308kb
input:
4 1
output:
9
result:
ok 1 number(s): "9"
Test #12:
score: 0
Accepted
time: 2ms
memory: 3324kb
input:
4 2
output:
4752
result:
ok 1 number(s): "4752"
Test #13:
score: 0
Accepted
time: 2ms
memory: 3300kb
input:
4 3
output:
17927568
result:
ok 1 number(s): "17927568"
Test #14:
score: 0
Accepted
time: 2ms
memory: 3308kb
input:
4 4
output:
776703752
result:
ok 1 number(s): "776703752"
Test #15:
score: 0
Accepted
time: 2ms
memory: 3400kb
input:
5 2
output:
440192
result:
ok 1 number(s): "440192"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3388kb
input:
5 3
output:
189125068
result:
ok 1 number(s): "189125068"
Test #17:
score: 0
Accepted
time: 2ms
memory: 3420kb
input:
5 4
output:
975434093
result:
ok 1 number(s): "975434093"
Test #18:
score: 0
Accepted
time: 116ms
memory: 28884kb
input:
1000 1000
output:
720037464
result:
ok 1 number(s): "720037464"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
72 42
output:
638177567
result:
ok 1 number(s): "638177567"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3468kb
input:
15 19
output:
663050288
result:
ok 1 number(s): "663050288"
Test #21:
score: 0
Accepted
time: 3ms
memory: 3560kb
input:
68 89
output:
94365047
result:
ok 1 number(s): "94365047"
Test #22:
score: 0
Accepted
time: 1ms
memory: 3440kb
input:
92 37
output:
652605307
result:
ok 1 number(s): "652605307"
Test #23:
score: 0
Accepted
time: 2ms
memory: 3616kb
input:
61 87
output:
498277867
result:
ok 1 number(s): "498277867"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3400kb
input:
81 40
output:
133095344
result:
ok 1 number(s): "133095344"
Test #25:
score: 0
Accepted
time: 2ms
memory: 3460kb
input:
7 91
output:
524164813
result:
ok 1 number(s): "524164813"
Test #26:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
31 18
output:
361233485
result:
ok 1 number(s): "361233485"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3408kb
input:
74 54
output:
500686087
result:
ok 1 number(s): "500686087"
Test #28:
score: 0
Accepted
time: 2ms
memory: 3464kb
input:
32 2
output:
586504335
result:
ok 1 number(s): "586504335"
Test #29:
score: 0
Accepted
time: 57ms
memory: 15328kb
input:
656 718
output:
346764298
result:
ok 1 number(s): "346764298"
Test #30:
score: 0
Accepted
time: 26ms
memory: 7988kb
input:
254 689
output:
358078813
result:
ok 1 number(s): "358078813"
Test #31:
score: 0
Accepted
time: 65ms
memory: 16388kb
input:
713 674
output:
914437613
result:
ok 1 number(s): "914437613"
Test #32:
score: 0
Accepted
time: 11ms
memory: 5548kb
input:
136 698
output:
56687290
result:
ok 1 number(s): "56687290"
Test #33:
score: 0
Accepted
time: 21ms
memory: 7764kb
input:
369 401
output:
312325811
result:
ok 1 number(s): "312325811"
Test #34:
score: 0
Accepted
time: 4ms
memory: 4568kb
input:
280 204
output:
280012063
result:
ok 1 number(s): "280012063"
Test #35:
score: 0
Accepted
time: 21ms
memory: 8296kb
input:
904 225
output:
162909174
result:
ok 1 number(s): "162909174"
Test #36:
score: 0
Accepted
time: 116ms
memory: 24804kb
input:
855 928
output:
39885159
result:
ok 1 number(s): "39885159"
Test #37:
score: 0
Accepted
time: 23ms
memory: 8180kb
input:
503 365
output:
745115888
result:
ok 1 number(s): "745115888"
Test #38:
score: 0
Accepted
time: 105ms
memory: 22820kb
input:
646 996
output:
610925577
result:
ok 1 number(s): "610925577"
Test #39:
score: 0
Accepted
time: 122ms
memory: 27596kb
input:
990 918
output:
203469632
result:
ok 1 number(s): "203469632"
Test #40:
score: 0
Accepted
time: 117ms
memory: 26224kb
input:
961 949
output:
169566857
result:
ok 1 number(s): "169566857"
Test #41:
score: 0
Accepted
time: 121ms
memory: 27480kb
input:
946 932
output:
352423195
result:
ok 1 number(s): "352423195"
Test #42:
score: 0
Accepted
time: 125ms
memory: 25688kb
input:
903 981
output:
196309824
result:
ok 1 number(s): "196309824"
Test #43:
score: 0
Accepted
time: 123ms
memory: 26224kb
input:
916 988
output:
487208972
result:
ok 1 number(s): "487208972"
Test #44:
score: 0
Accepted
time: 124ms
memory: 28068kb
input:
982 982
output:
387421488
result:
ok 1 number(s): "387421488"
Test #45:
score: 0
Accepted
time: 122ms
memory: 25776kb
input:
955 911
output:
955637031
result:
ok 1 number(s): "955637031"
Test #46:
score: 0
Accepted
time: 117ms
memory: 27272kb
input:
906 999
output:
798469943
result:
ok 1 number(s): "798469943"
Test #47:
score: 0
Accepted
time: 125ms
memory: 28096kb
input:
982 975
output:
193506289
result:
ok 1 number(s): "193506289"
Test #48:
score: 0
Accepted
time: 119ms
memory: 26748kb
input:
921 991
output:
431202149
result:
ok 1 number(s): "431202149"