暴力交叉匹配——La Vie en rose ( HDU 5745 )(2016 Multi-University Training Contest 2 1012)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

int n,m;
char  tar[112345];
char pat[6666];
int ans[112345];

int main()
{
int T;
cin >> T;
while(T--)
{
scanf("%d%d", &n, &m);
scanf("%s", &tar);
scanf("%s", &pat);
memset(vis, 0, sizeof(vis));
memset(ans, 0 , sizeof(ans));
for(int i=0; i<n;i++)
{
for(int j=0,k=i;j<m;)
{
if(tar[k]==pat[j])
j++,k++;
else if( tar[k]==pat[j+1] && tar[k+1]==pat[j] )
j+=2,k+=2;
else
break;
if(j == m)
ans[i] = 1;
}
}
for(int i=0;i<n;i++)
cout << ans[i];
cout << endl;
}
}