QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#764828 | #9479. And DNA | forgotmyhandle | AC ✓ | 1ms | 3724kb | C++14 | 2.2kb | 2024-11-20 10:52:00 | 2024-11-20 10:52:18 |
Judging History
answer
#include <iostream>
#include <string.h>
#include <cassert>
#include <map>
#define int long long
using namespace std;
const int P = 998244353;
struct Matrix {
int a[4][4];
Matrix() { memset(a, 0, sizeof a); }
void ini(int x = 1) { for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) a[i][j] = (i == j) * x; }
int* operator[](int x) { return a[x]; }
} I, T;
Matrix operator*(Matrix a, Matrix b) {
Matrix c;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++)
c[i][j] += a[i][k] * b[k][j] % P;
c[i][j] %= P;
}
}
return c;
}
Matrix qpow(Matrix x, int y) {
Matrix ret;
ret.ini();
while (y) {
if (y & 1)
ret = ret * x;
y >>= 1;
x = x * x;
}
return ret;
}
int n, m;
int a[105];
int ans;
bool chk() {
a[0] = a[n], a[n + 1] = a[1];
bool ok = 1;
for (int i = 1; i <= n; i++) ok &= (a[i] + (a[i - 1] & a[i + 1]) == m);
if (ok) {
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << "\n";
// for (int i = 1; i <= n; i++) assert((a[i] & a[i - 1] & a[i + 1]) == 0);
}
return ok;
}
void dfs(int x) {
if (x == n + 1) {
ans += chk();
return;
}
for (int i = 0; i <= m; i++) a[x] = i, dfs(x + 1);
}
int ans0;
map<int, int> mp;
int dfss(int x) {
if (mp.count(x))
return mp[x];
if (x & 1)
return mp[x] = dfss(x >> 1) * ans0 % P;
else
return mp[x] = (dfss(x >> 1) + dfss((x >> 1) - 1)) % P;
}
/*
010
011
101
110
*/
signed main() {
cin >> n >> m;
T[1][2] = T[1][3] = T[2][1] = T[3][2] = 1;
I.ini(0); I[0][1] = 1; I = I * qpow(T, n - 2); ans0 += I[0][1] + I[0][3];
// cout << ans0 << "\n";
I.ini(0); I[0][2] = 1; I = I * qpow(T, n - 2); ans0 += I[0][1] + I[0][2];
// cout << ans0 << "\n";
I.ini(0); I[0][3] = 1; I = I * qpow(T, n - 2); ans0 += I[0][0] + I[0][2];
ans0 %= P;
// dfs(1);
// cout << ans << "\n";
// cout << ans0 << "\n";
mp[0] = 1;
cout << dfss(m) << "\n";
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3720kb
input:
3 2
output:
4
result:
ok "4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
3 0
output:
1
result:
ok "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
100 100
output:
343406454
result:
ok "343406454"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
686579306 119540831
output:
260602195
result:
ok "260602195"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
26855095 796233790
output:
492736984
result:
ok "492736984"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3724kb
input:
295310488 262950628
output:
503008241
result:
ok "503008241"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
239670714 149827706
output:
994702969
result:
ok "994702969"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
790779949 110053353
output:
898252188
result:
ok "898252188"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
726600542 795285932
output:
183726777
result:
ok "183726777"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
957970519 585582861
output:
298814018
result:
ok "298814018"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
93349859 634036506
output:
110693443
result:
ok "110693443"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
453035113 34126396
output:
306244220
result:
ok "306244220"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
31994526 100604502
output:
930620701
result:
ok "930620701"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
234760741 249817734
output:
440195858
result:
ok "440195858"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
542621111 646412689
output:
207377992
result:
ok "207377992"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
28492783 602632297
output:
65234506
result:
ok "65234506"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
213500301 768820204
output:
540205113
result:
ok "540205113"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
697808101 753041955
output:
93561295
result:
ok "93561295"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
585126464 450455977
output:
91109717
result:
ok "91109717"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
236696315 482334538
output:
925575199
result:
ok "925575199"
Test #21:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
632719214 298704996
output:
358926097
result:
ok "358926097"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
869119333 933404114
output:
318501108
result:
ok "318501108"
Test #23:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
6977994 814763202
output:
585332987
result:
ok "585332987"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
3 1
output:
3
result:
ok "3"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
3 1000000000
output:
279679226
result:
ok "279679226"
Test #26:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
4 0
output:
1
result:
ok "1"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
4 1
output:
2
result:
ok "2"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
4 1000000000
output:
1755648
result:
ok "1755648"
Test #29:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1000000000 0
output:
1
result:
ok "1"
Test #30:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
1000000000 1
output:
696798313
result:
ok "696798313"
Test #31:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
1000000000 1000000000
output:
703786301
result:
ok "703786301"
Extra Test:
score: 0
Extra Test Passed