QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #269768 | #7754. Rolling For Days | FISHER_ | AC ✓ | 365ms | 64888kb | C++20 | 2.5kb | 2023-11-29 22:53:43 | 2023-11-29 22:53:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
inline int sqr(int x) { return 1ll * x * x % mod; }
int qpow(int a, int b) {
if (!b) return 1;
int t = qpow(a, b >> 1);
t = mul(t, t);
if (b & 1) return mul(t, a);
return t;
}
const int maxn = 1000, maxm = 12;
int fac[maxn + 5], ifac[maxn + 5];
void init(int n) {
fac[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = mul(fac[i - 1], i);
ifac[n] = qpow(fac[n], mod - 2);
for (int i = n - 1; ~i; i--) ifac[i] = mul(ifac[i + 1], i + 1);
}
inline int C(int m, int n) { return mul(fac[m], mul(ifac[m - n], ifac[n])); }
int a[maxm + 5], b[maxm + 5];
int sa[1 << maxm], sb[1 << maxm];
int f[maxn + 5][1 << maxm], g[maxn + 5][1 << maxm];
int sf[maxn + 5][1 << maxm], sg[maxn + 5][1 << maxm], sg2[maxn + 5][1 << maxm];
int p[maxn + 5][maxn + 5];
inline void upd(int& x, int y) { x = add(x, y); }
int main() {
int n, m, Na = 0, Nb = 0;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) scanf("%d", &a[i]);
int ss = 0;
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]), Nb += b[i];
if (!b[i]) ss |= 1 << i;
else Na += a[i];
}
int S = 1 << m;
for (int s = 0; s < S; s++) {
sa[s] = n;
for (int i = 0; i < m; i++)
if ((s >> i) & 1) sa[s] -= a[i], sb[s] += b[i];
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) p[i][j] = add(p[i][j - 1], mul(n - j + 1, qpow(i - j + 1, mod - 2)));
init(n);
sg[0][ss] = ifac[Na];
for (int i = 1; i <= Nb; i++)
for (int s = 0; s < S; s++) {
if (i < sb[s]) continue;
for (int x = 0; x < m; x++)
if ((s >> x) & 1) {
int fs = s ^ (1 << x);
upd(f[i][s], mul(add(sub(mul(sg[i - 1][fs], p[sa[fs] + sb[fs]][i]), sg2[i - 1][fs]), sf[i - 1][fs]), mul(C(i - 1 - sb[fs], b[x] - 1), fac[sa[fs] - i + sb[fs]])));
upd(g[i][s], mul(sg[i - 1][fs], mul(C(i - 1 - sb[fs], b[x] - 1), fac[sa[fs] - i + sb[fs]])));
}
sf[i][s] = add(sf[i - 1][s], mul(f[i][s], ifac[sa[s] - i + sb[s]]));
sg[i][s] = add(sg[i - 1][s], mul(g[i][s], ifac[sa[s] - i + sb[s]]));
sg2[i][s] = add(sg2[i - 1][s], mul(g[i][s], mul(ifac[sa[s] - i + sb[s]], p[sa[s] + sb[s]][i])));
}
int ans = f[Nb][S - 1];
for (int i = 0; i < m; i++) ans = mul(ans, mul(fac[a[i]], ifac[a[i] - b[i]]));
printf("%d", ans);
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 5972kb
input:
2 2 1 1 1 1
output:
2
result:
ok answer is '2'
Test #2:
score: 0
Accepted
time: 1ms
memory: 5820kb
input:
4 2 2 2 2 1
output:
582309210
result:
ok answer is '582309210'
Test #3:
score: 0
Accepted
time: 1ms
memory: 6048kb
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: 1ms
memory: 6076kb
input:
4 4 1 1 1 1 1 1 1 0
output:
831870299
result:
ok answer is '831870299'
Test #5:
score: 0
Accepted
time: 1ms
memory: 6004kb
input:
5 2 4 1 2 1
output:
598946616
result:
ok answer is '598946616'
Test #6:
score: 0
Accepted
time: 1ms
memory: 5956kb
input:
5 2 3 2 3 1
output:
482484776
result:
ok answer is '482484776'
Test #7:
score: 0
Accepted
time: 0ms
memory: 5996kb
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: 0ms
memory: 5956kb
input:
3 3 1 1 1 1 1 0
output:
499122180
result:
ok answer is '499122180'
Test #9:
score: 0
Accepted
time: 0ms
memory: 7984kb
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: 5952kb
input:
3 2 2 1 2 0
output:
499122180
result:
ok answer is '499122180'
Test #11:
score: 0
Accepted
time: 1ms
memory: 6148kb
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: 1ms
memory: 6176kb
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: 1ms
memory: 6132kb
input:
20 4 5 4 3 8 1 2 2 3
output:
156108321
result:
ok answer is '156108321'
Test #14:
score: 0
Accepted
time: 1ms
memory: 6188kb
input:
15 2 6 9 2 8
output:
672033760
result:
ok answer is '672033760'
Test #15:
score: 0
Accepted
time: 3ms
memory: 6340kb
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: 0ms
memory: 6696kb
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: 0ms
memory: 6056kb
input:
20 2 19 1 1 1
output:
299473325
result:
ok answer is '299473325'
Test #18:
score: 0
Accepted
time: 1ms
memory: 6172kb
input:
19 2 14 5 10 1
output:
497380388
result:
ok answer is '497380388'
Test #19:
score: 0
Accepted
time: 0ms
memory: 10784kb
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: 2ms
memory: 10372kb
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: 0ms
memory: 6484kb
input:
100 4 15 38 24 23 0 20 0 1
output:
635309463
result:
ok answer is '635309463'
Test #22:
score: 0
Accepted
time: 0ms
memory: 7300kb
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: 13ms
memory: 8708kb
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: 7ms
memory: 8284kb
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: 9104kb
input:
100 3 10 60 30 0 28 21
output:
261595276
result:
ok answer is '261595276'
Test #26:
score: 0
Accepted
time: 0ms
memory: 8536kb
input:
84 2 39 45 4 23
output:
897695217
result:
ok answer is '897695217'
Test #27:
score: 0
Accepted
time: 207ms
memory: 45148kb
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: 116ms
memory: 30704kb
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: 207ms
memory: 52824kb
input:
1000 2 374 626 175 591
output:
501708945
result:
ok answer is '501708945'
Test #30:
score: 0
Accepted
time: 98ms
memory: 27592kb
input:
701 1 701 413
output:
413
result:
ok answer is '413'
Test #31:
score: 0
Accepted
time: 348ms
memory: 59456kb
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: 229ms
memory: 31696kb
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: 200ms
memory: 36024kb
input:
1000 4 473 65 438 24 79 61 327 24
output:
491224221
result:
ok answer is '491224221'
Test #34:
score: 0
Accepted
time: 157ms
memory: 31748kb
input:
870 4 320 17 182 351 145 0 181 4
output:
664946681
result:
ok answer is '664946681'
Test #35:
score: 0
Accepted
time: 325ms
memory: 48984kb
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: 336ms
memory: 59432kb
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: 294ms
memory: 40888kb
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: 365ms
memory: 64888kb
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: 334ms
memory: 58152kb
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: 330ms
memory: 54548kb
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