#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define OPEN freopen(".in", "r", stdin); \
freopen(".out", "w", stdout);
#else
#define OPEN void(23);
#endif
string arr[55][1505];
int dp[55][1505][1505];
bool check(string &a, string &b)
{
int n = b.size();
bool ok = true;
for(int i = 1; i <= n -1; i++)
{
ok &= a[i -1] == b[i -1];
}
if(ok) return true;
ok = true;
for(int i = 2; i <= n; i++)
{
ok &= a[i -2] == b[i -1];
}
return ok;
}
void solve()
{
memset(dp, -1, sizeof dp);
int n, k; cin >> n >> k;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= k; j++)
cin >> arr[i][j];
function <int(int, int, int)> f = [&](int x, int bef, int nw) -> int
{
if(x == n) return check(arr[x -1][bef], arr[x][nw]);
int &it = dp[x][bef][nw];
if(it != -1) return it;
if(!check(arr[x -1][bef], arr[x][nw])) return it = 0;
//cerr << x << " " << bef << " " << nw << "\n";
int res = 0;
for(int i = 1; i <= k; i++)
{
int calc = f(x +1, nw, i);
res = (res + calc) % MOD;
}
return it = res;
};
int cev = 0;
for(int i = 1; i <= k; i++)
cev = (cev + f(1, 0, i)) % MOD;
cout << cev;
return;
}
int32_t main()
{
OPEN;
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1; //cin >> t;
while(t--)
{
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
81 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
64 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
81 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |