QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#66583 | #5169. 夹娃娃 | hjl666 | 0 | 32ms | 5596kb | C++14 | 2.6kb | 2022-12-09 08:57:03 | 2022-12-09 08:57:04 |
Judging History
answer
#include<bits/stdc++.h>
#define db double
#define int ll
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define MP make_pair
#define pii pair<int, int>
#define fi first
#define se second
#define ls k<<1
#define rs k<<1|1
#define CLK (double)clock()/(double)CLOCKS_PER_SEC
using namespace std;
mt19937 rnd(time(0));
inline int read(){
register int x=0,f=1;
register char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
inline void write(register int x){
if(x<0){putchar('-');x=-x;}
if(x>9)write(x/10);
putchar(x%10+'0');
}
const int N=1025,mod=998244353,G=3;
int rev[N];
int Qpow(int b,int p){
int res=1ll;
while(p){if(p&1)(res*=b)%=mod;(b*=b)%=mod;p>>=1;}
return res;
}
void change(int *y,int n){
for(int i=0;i<n;i++){
rev[i]=rev[i>>1]>>1;
if(i&1)rev[i]|=(n>>1);
}
for(int i=0;i<n;i++)if(i<rev[i])swap(y[i],y[rev[i]]);
}
void NTT(int *y,int n,int on){
change(y,n);
for(int h=2;h<=n;h<<=1){
int gn=Qpow(G,(mod-1)/h);
if(on==-1)gn=Qpow(gn,mod-2);
for(int j=0;j<n;j+=h){
int g=1;
for(int k=j;k<j+h/2;k++){
int u=y[k],t=g*y[k+h/2]%mod;
y[k]=(u+t)%mod,y[k+h/2]=(u-t+mod)%mod;
(g*=gn)%=mod;
}
}
}
if(on==1)return ;
int ivn=Qpow(n,mod-2);
for(int i=0;i<n;i++)(y[i]*=ivn)%=mod;
}
int n,q,p,len,a[20],b[20][N],c[20][N],A[20][530][N],B[20][N],C[20][N],D[N];
char s[53000][20];
int m[53000],k[53000];
void prework(int i,int j,int *a){
for(int k=0;k<=c[i][j];k++)a[k*b[i][j]]=1;
}
void MAIN(){
n=read();q=read();p=read();len=1024;
for(int i=1;i<=n;i++){
a[i]=read();
for(int j=1;j<=a[i];j++)b[i][j]=read(),c[i][j]=read();
}
for(int i=1;i<=q;i++)scanf("%s",s[i]+1),m[i]=read(),k[i]=read();
for(int id=1;id<=n;id++){
for(int i=1;i<=a[id];i++)prework(id,i,A[id][i]);
for(int i=1;i<=a[id];i++)NTT(A[id][i],len,1);
memcpy(B[id],A[id][1],sizeof A[id][1]);
for(int i=2;i<=a[id];i++)for(int j=0;j<=len;j++)B[id][j]=B[id][j]*A[id][i][j]%mod;
NTT(B[id],len,-1);
}
for(int _=1;_<=q;_++){
for(int id=1;id<=n;id++){
for(int j=0;j<=len;j++)C[id][j]=B[id][j];
if(s[_][id]=='1')for(int j=0;j<k[_];j++)C[id][j]=0;
NTT(C[id],len,1);
}
memcpy(D,C[1],sizeof C[1]);
for(int id=2;id<=n;id++)for(int j=0;j<=len;j++)D[j]=D[j]*C[id][j]%mod;
NTT(D,len,-1);
int res=0;
for(int i=0;i<=m[_];i++)(res+=D[i])%=mod;
cout<<res<<"\n";
}
}
signed main(){
//freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
int T=1;while(T--)MAIN();
// printf("\nTIME:%lf\n",(double)clock()/CLOCKS_PER_SEC);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 32ms
memory: 5596kb
input:
1 521 998244353 39 520 520 11 22 414 8 95 18 229 356 26 407 316 10 24 26 19 61 11 130 482 476 420 15 192 193 208 24 19 233 494 217 275 294 26 28 439 20 272 277 28 198 5 335 22 8 28 17 154 78 6 13 175 17 2 5 477 256 200 4 1 36 427 371 439 23 10 65 426 25 24 27 121 29 28 13 12 453 0 520 1 1 519 1 1 51...
output:
391111654 83576586 479126829 147943168 172500042 159226046 587492175 814952042 247547339 356571314 824156916 440548602 458542766 780814685 366784716 720859854 293662572 589532134 406865038 417181772 505186332 35070514 581696390 548334991 975089797 892871637 722710107 566614534 559249849 521864488 48...
result:
wrong answer 1st lines differ - expected: '38813347', found: '391111654'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Time Limit Exceeded
Test #9:
score: 0
Time Limit Exceeded
input:
15 52099 998244353 1 9 3 1 9 4 1 9 2 1 8 10 1 4 4 1 3 1 1 2 5 1 4 9 1 1 4 1 9 4 1 7 6 1 1 6 1 2 5 1 5 2 1 3 5 101000000001010 516 1 010001001010101 520 2 000000101000001 519 2 101011111100011 518 1 010110001000111 520 2 000110111100111 516 1 000100101001011 519 3 000111001010011 518 1 00001110010111...
output:
993379058 496689529 866368587 797687294 481245176 481245176 39022588 269889529 552778235 769822588 331666941 99789529 903956470 112750588 756797435 519045176 870912000 361582588 594280447 494747647 597778941 178845176 435456000 493445999 461733882 308912117 271186941 496689529 919511294 85533882 894...
result:
Subtask #5:
score: 0
Skipped
Dependency #3:
0%
Subtask #6:
score: 0
Skipped
Dependency #4:
0%
Subtask #7:
score: 0
Skipped
Dependency #6:
0%