计蒜客A1676 Rock Paper Scissors Lizard Spock

链接

https://nanti.jisuanke.com/t/A1676

题解

每种分开算，比如我先考虑出$scissors$，把模式串中的所有$S$处置为$1$，其它位置置为$0$；原串中的能被$S$干掉的都设为$1$，其余设为$0$
然后多项式卷积

代码

#include <bits/stdc++.h>
#define mod 1004535809ll
#define maxn (2097152+10)
#define cl(x)memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
struct EasyMath
{
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
}em;
struct NTT
{
    ll up, R[maxn];
    void init(ll bound)    //bound是积多项式的最高次幂
    {
        ll L(0);
        for(up=1;up<=bound;up<<=1,L++);
        for(ll i=0;i<up;i++)R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    }
    void ntt(ll* a, int opt)
    {
        ll i, j, k, wn, w, x, y, inv(em.fastpow(up,mod-2,mod));
        for(i=0;i<up;i++)if(i>R[i])swap(a[i],a[R[i]]);
        for(i=1;i<up;i<<=1)
        {
            if(opt==1)wn=em.fastpow(3,(mod-1)/(i<<1),mod);
            else wn=em.fastpow(3,(mod-1-(mod-1)/(i<<1)),mod);
            for(j=0;j<up;j+=i<<1)
                for(w=1,k=0;k<i;k++,w=w*wn%mod)
                {
                    x=a[k+j], y=a[k+j+i]*w%mod;
                    a[k+j]=(x+y)%mod, a[k+j+i]=(x-y+mod)%mod;
                }
        }
        if(opt==-1)for(i=0;i<up;i++)(a[i]*=inv)%=mod;
    }
    void juan(ll* a, ll* b, ll* c)
    {
        ntt(a,1), ntt(b,1);
        for(int i=0;i<up;i++)c[i]=a[i]*b[i];
        ntt(c,-1);
    }
}ntt;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-48;
    return f*x;
}
char s[maxn], t[maxn];
ll ans[maxn], a[maxn], b[maxn], c[maxn];
int main()
{
    char table[200];
    ll i, n, m, d, x;
    scanf("%s%s",s,t);
    n=strlen(s), m=strlen(t);
    table['S']=0, table['P']=1, table['R']=2, table['L']=3, table['K']=4;
    for(i=0;i<n;i++)s[i]=table[s[i]];
    for(i=0;i<m;i++)t[i]=table[t[i]];
    ntt.init(n+m);
    for(x=0;x<5;x++)
    {
        cl(a), cl(b), cl(c);
        for(i=0;i<n;i++)a[i]=(s[i]==(x+1)%5 or s[i]==(x+3)%5);
        for(i=0;i<m;i++)b[i]=(t[i]==x);
        reverse(b,b+m);
        ntt.juan(a,b,c);
        for(i=0;i+m-1<n;i++)ans[i]+=c[m-1+i];
    }
    ll mx=0;
    for(i=0;i+m-1<n;i++)mx=max(ans[i],mx);
    cout<<mx;
    return 0;
}