【bitset】hdu5782

循环相等，就相当于前缀循环了一遍然后找相等串

然后就是分为一部分正向，一部分反向，然后bitset优化一下

#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=10050;
bitset <maxn> dp[2][maxn];
bitset <maxn> letter[2][27];
char s1[maxn],s2[maxn];
int main()
{
   freopen("input.txt","r",stdin);
    while (~scanf("%s ",s1))
    {
        for (int i=0;i<26;i++)
        {
            letter[0][i].reset();
            letter[1][i].reset();
            letter[0][i].set(strlen(s1)+1);
            letter[1][i].set(0);
        }
        scanf("%s ",s2);
        int len=strlen(s2);
        for (int i=strlen(s2)-1;i>=0;i--)
        {
            letter[0][s1[i]-'a'].set(len-(i+1)+1);
            letter[1][s2[i]-'a'].set(i+1);
        }
        dp[0][0].reset();
        dp[1][0].reset();
        for (int i=0;i<=len;i++)
        {
            dp[0][i].set(0);
            dp[0][i+1]=(dp[0][i]<<1)&letter[1][s1[i]-'a'];
        }
        for (int i=0;i<=len;i++)
        {
            dp[1][i].set(len+1);
            dp[1][i+1]=(dp[1][i]>>1)&letter[0][s2[i]-'a'];
        }
        bitset <maxn> c;
        for (int i=1;i<=len;i++)
        {
            c=dp[0][i]&(dp[1][i]>>(len-i+1));
            if (c.any()) printf("1");
            else printf("0");
        }
        printf("\n");
    }
    return 0;
}