0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 21:28:48 +00:00

P1758 [NOI2009] 管道取珠

https://www.luogu.com.cn/record/101603287
This commit is contained in:
Baoshuo Ren 2023-02-06 22:12:40 +08:00
parent 05cda6bedf
commit 77ce5fd3ac
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A

58
Luogu/P1758/P1758.cpp Normal file
View File

@ -0,0 +1,58 @@
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 505;
const int mod = 1024523;
int n, m, f[2][N][N]{1};
std::string a, b;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> a >> b;
std::reverse(a.begin(), a.end());
std::reverse(b.begin(), b.end());
a = ' ' + a;
b = ' ' + b;
for (int k = 1; k <= n + m; k++) {
int t = k & 1,
p = t ^ 1;
memset(f[t], 0x00, sizeof(f[t]));
for (int i = std::max(0, k - m); i <= std::min(n, k); i++) {
for (int j = std::max(0, k - m); j <= std::min(n, k); j++) {
if (i && j && a[i] == a[j]) {
f[t][i][j] = (f[t][i][j] + f[p][i - 1][j - 1]) % mod;
}
if (i && k - j && a[i] == b[k - j]) {
f[t][i][j] = (f[t][i][j] + f[p][i - 1][j]) % mod;
}
if (k - i && j && b[k - i] == a[j]) {
f[t][i][j] = (f[t][i][j] + f[p][i][j - 1]) % mod;
}
if (k - i && k - j && b[k - i] == b[k - j]) {
f[t][i][j] = (f[t][i][j] + f[p][i][j]) % mod;
}
}
}
}
cout << f[(n + m) & 1][n][n] << endl;
return 0;
}