QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #479478 | #7754. Rolling For Days | ucup-team052# | AC ✓ | 308ms | 39812kb | C++23 | 2.3kb | 2024-07-15 17:48:08 | 2024-07-15 17:48:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define mod 998244353
inline int add(int x,int y) {return x+y>=mod?x+y-mod:x+y;}
inline int sub(int x,int y) {return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y) {return 1LL*x*y%mod;}
inline int mul(int x,int y,int z) {return mul(mul(x,y),z);}
#define inc(x,y) x=add(x,y)
#define N 12
int a[N],b[N],f[1<<N][1005],g[1<<N][1005];
int C[1005][1005],sum[1<<N],n,m;
int sa[1<<N];
int inv[1005],fac[1005];
signed main() {
#ifdef xay5421
freopen("b.in","r",stdin);
#endif
cin>>n>>m;
for(int i=0;i<m;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
C[0][0]=1;
for(int i=1;i<=1000;i++)
{
C[i][0]=1;
for(int j=1;j<=i;j++) C[i][j]=add(C[i-1][j],C[i-1][j-1]);
}
fac[0]=1; for(int i=1;i<=1000;i++) fac[i]=mul(fac[i-1],i);
inv[0]=inv[1]=1; for(int i=2;i<=1000;i++) inv[i]=mul(mod-mod/i,inv[mod%i]);
int cur=0;
for(int i=0;i<m;i++) if(b[i]==0) cur|=1<<i;
f[cur][0]=1;
for(int i=0;i<1<<m;i++)
{
for(int j=0;j<m;j++) if(i>>j&1) sum[i]+=b[j];
}
for(int i=0;i<1<<m;i++)
{
for(int j=0;j<m;j++) if(i>>j&1) sa[i]+=a[j];
}
int ful=(1<<m)-1;
for(int st=0;st<1<<m;st++)
{
for(int i=0;i<=n;i++) if(f[st][i]||g[st][i])
{
int NA=mul(n-sum[st]-i,inv[sa[st^ful]-i]);
int ti=inv[n-sa[st]-i];
{ // add 1
f[st][i+1]=add(f[st][i+1],mul(f[st][i],ti));
g[st][i+1]=add(g[st][i+1],mul(g[st][i],ti));
int nw=mul(f[st][i],NA);
inc(g[st][i+1],mul(nw,ti));
}
{ // boom
for(int j=0;j<m;j++) if(!(st>>j&1))
{
if(i<b[j]-1) continue;
int cw=mul(f[st][i],C[i][b[j]-1]);
inc(f[st|(1<<j)][i-b[j]+1],mul(cw,ti));
inc(g[st|(1<<j)][i-b[j]+1],mul(g[st][i],C[i][b[j]-1],ti));
inc(g[st|(1<<j)][i-b[j]+1],mul(NA,cw,ti));
}
}
}
}
// for(int i=0;i<1<<m;i++) for(int j=0;j<=n;j++) printf("%d%c",f[i][j]," \n"[j==n]);
// for(int i=0;i<1<<m;i++) for(int j=0;j<=n;j++) printf("%d%c",g[i][j]," \n"[j==n]);
int ans=g[ful][0];
for(int i=0;i<m;i++) for(int j=0;j<b[i];j++) ans=mul(ans,a[i]-j);
// for(int i=0;i<sum[ful];i++) ans=mul(ans,inv[n-i]);
cout<<ans<<endl;
return 0;
}
/*
1 1 1 1 1
1 3 6 10 10
1 2 3 4 5
3 12 30 60 70
0 1 2 3 4
2 9 24 40 40
1 499122181 499122188 499122195 499122199
499122188 499122232 135 265 305
415935149
*/
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 11196kb
input:
2 2 1 1 1 1
output:
2
result:
ok answer is '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 10088kb
input:
4 2 2 2 2 1
output:
582309210
result:
ok answer is '582309210'
Test #3:
score: 0
Accepted
time: 0ms
memory: 11020kb
input:
5 5 1 1 1 1 1 0 0 0 0 1
output:
5
result:
ok answer is '5'
Test #4:
score: 0
Accepted
time: 2ms
memory: 10380kb
input:
4 4 1 1 1 1 1 1 1 0
output:
831870299
result:
ok answer is '831870299'
Test #5:
score: 0
Accepted
time: 0ms
memory: 11184kb
input:
5 2 4 1 2 1
output:
598946616
result:
ok answer is '598946616'
Test #6:
score: 0
Accepted
time: 0ms
memory: 11120kb
input:
5 2 3 2 3 1
output:
482484776
result:
ok answer is '482484776'
Test #7:
score: 0
Accepted
time: 1ms
memory: 10068kb
input:
5 5 1 1 1 1 1 0 1 1 1 0
output:
665496242
result:
ok answer is '665496242'
Test #8:
score: 0
Accepted
time: 1ms
memory: 10020kb
input:
3 3 1 1 1 1 1 0
output:
499122180
result:
ok answer is '499122180'
Test #9:
score: 0
Accepted
time: 1ms
memory: 10872kb
input:
5 5 1 1 1 1 1 1 0 1 1 1
output:
582309212
result:
ok answer is '582309212'
Test #10:
score: 0
Accepted
time: 1ms
memory: 11256kb
input:
3 2 2 1 2 0
output:
499122180
result:
ok answer is '499122180'
Test #11:
score: 0
Accepted
time: 2ms
memory: 10120kb
input:
20 5 1 6 7 2 4 0 1 3 1 4
output:
75028873
result:
ok answer is '75028873'
Test #12:
score: 0
Accepted
time: 0ms
memory: 11124kb
input:
15 5 4 2 3 4 2 2 1 1 2 1
output:
585494868
result:
ok answer is '585494868'
Test #13:
score: 0
Accepted
time: 0ms
memory: 10664kb
input:
20 4 5 4 3 8 1 2 2 3
output:
156108321
result:
ok answer is '156108321'
Test #14:
score: 0
Accepted
time: 0ms
memory: 9796kb
input:
15 2 6 9 2 8
output:
672033760
result:
ok answer is '672033760'
Test #15:
score: 0
Accepted
time: 2ms
memory: 11368kb
input:
20 12 1 2 1 1 2 4 1 3 2 1 1 1 1 0 0 1 0 0 1 0 2 0 1 1
output:
691640771
result:
ok answer is '691640771'
Test #16:
score: 0
Accepted
time: 3ms
memory: 11760kb
input:
19 12 1 1 1 2 1 2 2 1 2 4 1 1 1 1 0 1 1 0 1 1 0 2 1 0
output:
777326448
result:
ok answer is '777326448'
Test #17:
score: 0
Accepted
time: 2ms
memory: 11396kb
input:
20 2 19 1 1 1
output:
299473325
result:
ok answer is '299473325'
Test #18:
score: 0
Accepted
time: 1ms
memory: 10240kb
input:
19 2 14 5 10 1
output:
497380388
result:
ok answer is '497380388'
Test #19:
score: 0
Accepted
time: 1ms
memory: 10112kb
input:
100 5 10 25 6 19 40 0 2 4 5 11
output:
773338801
result:
ok answer is '773338801'
Test #20:
score: 0
Accepted
time: 0ms
memory: 9740kb
input:
64 5 1 12 13 33 5 1 0 1 20 0
output:
571823997
result:
ok answer is '571823997'
Test #21:
score: 0
Accepted
time: 2ms
memory: 11444kb
input:
100 4 15 38 24 23 0 20 0 1
output:
635309463
result:
ok answer is '635309463'
Test #22:
score: 0
Accepted
time: 1ms
memory: 10164kb
input:
88 5 15 25 9 19 20 8 15 9 18 17
output:
400310961
result:
ok answer is '400310961'
Test #23:
score: 0
Accepted
time: 4ms
memory: 12268kb
input:
100 12 2 2 13 9 13 7 2 1 6 15 17 13 0 0 5 7 10 7 0 1 0 0 4 4
output:
552732942
result:
ok answer is '552732942'
Test #24:
score: 0
Accepted
time: 4ms
memory: 18380kb
input:
59 12 7 6 3 5 4 6 5 2 5 6 5 5 4 5 2 5 3 6 0 2 1 0 3 3
output:
27023521
result:
ok answer is '27023521'
Test #25:
score: 0
Accepted
time: 0ms
memory: 9860kb
input:
100 3 10 60 30 0 28 21
output:
261595276
result:
ok answer is '261595276'
Test #26:
score: 0
Accepted
time: 1ms
memory: 10420kb
input:
84 2 39 45 4 23
output:
897695217
result:
ok answer is '897695217'
Test #27:
score: 0
Accepted
time: 0ms
memory: 10652kb
input:
1000 5 370 136 129 182 183 312 47 112 22 119
output:
705415872
result:
ok answer is '705415872'
Test #28:
score: 0
Accepted
time: 2ms
memory: 10432kb
input:
766 5 372 194 98 90 12 165 123 53 27 0
output:
870555094
result:
ok answer is '870555094'
Test #29:
score: 0
Accepted
time: 0ms
memory: 11020kb
input:
1000 2 374 626 175 591
output:
501708945
result:
ok answer is '501708945'
Test #30:
score: 0
Accepted
time: 1ms
memory: 10096kb
input:
701 1 701 413
output:
413
result:
ok answer is '413'
Test #31:
score: 0
Accepted
time: 297ms
memory: 39756kb
input:
1000 12 101 43 34 281 23 24 12 25 66 222 145 24 37 43 27 257 5 11 12 19 62 41 87 13
output:
265294941
result:
ok answer is '265294941'
Test #32:
score: 0
Accepted
time: 61ms
memory: 18596kb
input:
942 12 83 142 96 10 3 10 60 93 398 13 11 23 37 56 36 0 3 0 10 35 33 1 9 19
output:
956409637
result:
ok answer is '956409637'
Test #33:
score: 0
Accepted
time: 0ms
memory: 10756kb
input:
1000 4 473 65 438 24 79 61 327 24
output:
491224221
result:
ok answer is '491224221'
Test #34:
score: 0
Accepted
time: 2ms
memory: 10428kb
input:
870 4 320 17 182 351 145 0 181 4
output:
664946681
result:
ok answer is '664946681'
Test #35:
score: 0
Accepted
time: 151ms
memory: 32532kb
input:
1000 12 102 2 110 62 106 176 37 27 6 208 92 72 57 0 106 20 36 4 20 12 3 134 8 61
output:
3888811
result:
ok answer is '3888811'
Test #36:
score: 0
Accepted
time: 152ms
memory: 39648kb
input:
1000 12 1 44 209 187 27 71 127 139 134 22 20 19 0 19 153 113 27 29 82 74 37 19 20 9
output:
278584590
result:
ok answer is '278584590'
Test #37:
score: 0
Accepted
time: 299ms
memory: 39752kb
input:
1000 12 193 84 261 36 75 7 70 12 38 22 8 194 68 15 11 20 16 7 53 1 6 6 6 189
output:
704313398
result:
ok answer is '704313398'
Test #38:
score: 0
Accepted
time: 140ms
memory: 25416kb
input:
1000 12 171 135 21 74 115 3 4 122 32 70 224 29 71 120 20 66 61 2 1 102 28 0 201 3
output:
608268027
result:
ok answer is '608268027'
Test #39:
score: 0
Accepted
time: 291ms
memory: 39812kb
input:
1000 12 54 20 201 182 16 66 23 153 36 39 151 59 33 5 189 80 13 56 13 38 7 22 92 21
output:
795531860
result:
ok answer is '795531860'
Test #40:
score: 0
Accepted
time: 308ms
memory: 39760kb
input:
1000 12 218 16 12 152 67 64 65 3 90 263 44 6 107 2 2 143 11 28 53 2 55 106 39 5
output:
903827471
result:
ok answer is '903827471'
Extra Test:
score: 0
Extra Test Passed