QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#605540 | #8023. The Journey of Geor Autumn | ucup-team3519# | AC ✓ | 188ms | 159664kb | C++17 | 1.1kb | 2024-10-02 17:49:06 | 2024-10-02 17:49:06 |
Judging History
answer
#include <bits/stdc++.h>
constexpr int MOD = 998244353;
using i64 = int64_t;
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) {
res = (i64)res * a % MOD;
}
a = (i64)a * a % MOD, b >>= 1;
}
return res;
}
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> fact(n + 1), ifact(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; ++i) {
fact[i] = (i64)fact[i - 1] * i % MOD;
}
ifact[n] = qpow(fact[n], MOD - 2);
for (int i = n - 1; i >= 0; --i) {
ifact[i] = (i64)ifact[i + 1] * (i + 1) % MOD;
}
std::vector<int> f(n + 1), s(n + 1);
f[0] = 1, s[0] = 1;
f[1] = 1, s[1] = 2;
for (int i = 2; i <= n; ++i) {
int p = s[i - 1];
if (i - 1 - k >= 0) {
p = (p - s[i - 1 - k]) % MOD;
}
f[i] = (i64)p * fact[i - 1] % MOD;
s[i] = (s[i - 1] + (i64)f[i] * ifact[i]) % MOD;
// std::cout << f[i] << ' ' << s[i] << '\n';
}
std::cout << (f[n] + MOD) % MOD << '\n';
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
input:
1 1
output:
1
result:
ok "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1 2
output:
1
result:
ok "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 3
output:
1
result:
ok "1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
1 4
output:
1
result:
ok "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
2 1
output:
1
result:
ok "1"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
2 2
output:
2
result:
ok "2"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
2 3
output:
2
result:
ok "2"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
2 4
output:
2
result:
ok "2"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 1
output:
1
result:
ok "1"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
3 2
output:
4
result:
ok "4"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
3 3
output:
6
result:
ok "6"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
3 4
output:
6
result:
ok "6"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
4 1
output:
1
result:
ok "1"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
4 2
output:
10
result:
ok "10"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
4 3
output:
18
result:
ok "18"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
4 4
output:
24
result:
ok "24"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
99 50
output:
955866606
result:
ok "955866606"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
99 70
output:
296999003
result:
ok "296999003"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1034 998
output:
637688669
result:
ok "637688669"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
1099 997
output:
712935289
result:
ok "712935289"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
10314 998
output:
224695890
result:
ok "224695890"
Test #22:
score: 0
Accepted
time: 1ms
memory: 3788kb
input:
10929 9974
output:
160291286
result:
ok "160291286"
Test #23:
score: 0
Accepted
time: 3ms
memory: 4844kb
input:
103124 99448
output:
695932649
result:
ok "695932649"
Test #24:
score: 0
Accepted
time: 3ms
memory: 4896kb
input:
109139 9937
output:
268916696
result:
ok "268916696"
Test #25:
score: 0
Accepted
time: 19ms
memory: 19308kb
input:
1031234 99238
output:
441457721
result:
ok "441457721"
Test #26:
score: 0
Accepted
time: 20ms
memory: 20332kb
input:
1091239 991237
output:
61047495
result:
ok "61047495"
Test #27:
score: 0
Accepted
time: 177ms
memory: 159560kb
input:
10000000 9982443
output:
224744113
result:
ok "224744113"
Test #28:
score: 0
Accepted
time: 188ms
memory: 159664kb
input:
9999977 5678901
output:
641748125
result:
ok "641748125"
Extra Test:
score: 0
Extra Test Passed