题意:交换相邻字符,用二进制表示匹配。
/*
* @Author: biggf
* @Date: 2018-07-04 19:38:55
* @Last Modified by: biggf
* @Last Modified time: 2018-07-04 20:11:26
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<bitset>
using namespace std;
const int N = 100005;
const int M = 5005;
char a[N];
char b[M];
bitset<N>dp[2][3];
bitset<N>w[30];
int main()
{
int T;
int la, lb;
scanf("%d", &T);
while (T--)
{
scanf("%d%d", &la, &lb);
scanf("%s%s", a, b);
for (int i = 0; i < 26; i++)w[i].reset();
for (int i = 0; i < la; i++)w[a[i] - 'a'][i] = 1;
for (int i = 0; i < 2; i++)for (int j = 0; j < 3; j++)dp[i][j].reset();
dp[0][1] = w[b[0] - 'a'];
if (lb > 1)dp[0][2] = w[b[1] - 'a'];
int now = 0;
for (int j = 1; j < lb; j++)
{
now ^= 1;
dp[now][0] = ((dp[now ^ 1][2]) << 1)&w[b[j - 1] - 'a'];
dp[now][1] = ((dp[now ^ 1][0] | dp[now ^ 1][1]) << 1)&w[b[j] - 'a'];
if (j < lb - 1)dp[now][2] = ((dp[now ^ 1][0] | dp[now ^ 1][1]) << 1)&w[b[j + 1] - 'a'];
}
for (int i = 0; i < la; i++)
{
if (dp[now][0][i + lb - 1] || dp[now][1][i + lb - 1])printf("1");
else printf("0");
}
puts("");
}
}