这道题看起来神乎其神,实际上只是上一道题弱化版的弱化版。。只要构造一个目标串,包含两个输入串就行了。
dp[i][j][k][h],i跟j表示当前所在位置,k表示所在字典树节点,h表示两个字符串是否存在的状态(即0,1,2,3,分别表示都不存在,存在1号,存在2号,存在两个)。
然后就是简单dp。
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <queue>
#include <map>
#include <cstring>
#define fi first
#define se second
#define FIN freopen("in.txt","r",stdin)
#define FIO freopen("out.txt","w",stdout)
#define INF 0x3f3f3f3f
#define per(i,a,n) for(int i = a;i < n;i++)
#define rep(i,a,n) for(int i = n;i > a;i--)
#define pern(i,a,n) for(int i = a;i <= n;i++)
#define repn(i,a,n) for(int i = n;i >= a;i--)
#define fastio std::ios::sync_with_stdio(false)
#define all(a) a.begin(), a.end()
#define ll long long
#define pb push_back
#define endl "\n"
#define pii pair<int,int>
#define sc(n) scanf("%d", &n)
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
template<typename T> inline void _max(T &a,const T b){if(a<b) a = b;}
template<typename T> inline void _min(T &a,const T b){if(a>b) a = b;}
using namespace std;
//inline ll read(){
// ll a=0;int f=0;char p=getchar();
// while(!isdigit(p)){f|=p=='-';p=getchar();}
// while(isdigit(p)){a=(a<<3)+(a<<1)+(p^48);p=getchar();}
// return f?-a:a;
//}
const int maxn = 300;
const int mod = 1000000007 ;
const int maxnode = 2;
int ch[maxn][maxnode]; //字典树
int cnt[maxn]; //单词出现次数
int sz;
int fail[maxn];
char s[110];
int n,m;
int dp[110][110][maxn][4];
void init()
{
sz = 1;
memset(ch[0], 0, sizeof(ch[0]));
memset(cnt,0,sizeof(cnt));
memset(dp,0,sizeof(dp));
cnt[0] = 0;
}
int id(char c)
{
if(c == 'R')return 0;
else return 1;
}
void insert(char str[], int len,int i) //插入字符串
{
int u = 0;
per(i, 0, len)
{
int v = id(str[i]);
if (!ch[u][v])
{
memset(ch[sz], 0, sizeof(ch[sz]));
cnt[sz] = 0;
ch[u][v] = sz++;
}
u = ch[u][v];
}
cnt[u] = (1<<i);
//在这里我们可以建立一个int-string的映射,以通过节点序号得知这个点是哪个单词的结尾
}
void getfail()
{
//所有模式串已插入完成
queue<int> q;
per(i, 0,maxnode)
{
if (ch[0][i])
{
fail[ch[0][i]] = 0;
q.push(ch[0][i]);
}
}
while (!q.empty())
{
int now = q.front();
q.pop();
per(i, 0, maxnode)
{
if (ch[now][i])
{
fail[ch[now][i]] = ch[fail[now]][i];
q.push(ch[now][i]);
}
else
ch[now][i] = ch[fail[now]][i];
}
cnt[now] |= cnt[fail[now]];
}
}
void solve()
{
dp[0][0][0][0] = 1;
pern(i,0,n)
{
pern(j,0,m)
{
per(k,0,sz)
{
per(h,0,4)
{
if(dp[i][j][k][h] == 0)continue;
dp[i+1][j][ch[k][1]][h|cnt[ch[k][1]]] = (dp[i+1][j][ch[k][1]][h|cnt[ch[k][1]]]+dp[i][j][k][h])%mod;
dp[i][j+1][ch[k][0]][h|cnt[ch[k][0]]] = (dp[i][j+1][ch[k][0]][h|cnt[ch[k][0]]]+dp[i][j][k][h])%mod;
}
}
}
}
int ans = 0;
per(i,0,sz) ans = (ans+dp[n][m][i][3])%mod;
printf("%d\n",ans);
}
int main()
{
#ifndef ONLINE_JUDGE
int startTime = clock();
FIN;
#endif
//fastio;
//忘记初始化是小狗
//freopen("out.txt","w",stdout);
//ios::sync_with_stdio(false);
CASET
{
scanf("%d%d",&m,&n);
init();
per(i,0,2)
{
scanf("%s",s);
insert(s,strlen(s),i);
}
getfail();
solve();
}
#ifndef ONLINE_JUDGE
printf("\nTime = %dms\n", clock() - startTime);
#endif
return 0;
}