BZOJ[4259]残缺的字符串 FFT

传送门ber~

同BZOJ[4503]
不同的是在前面再乘一个$f_{i+j}$就可以了

代码如下：

#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#define N 1000020
using namespace std;
const double DFT=2.0,IDFT=-2.0;
const double pi=acos(-1),eps=0.5;
struct Complex{
    double x,y;
    Complex(double _=0,double __=0):x(_),y(__){}
    Complex operator + (const Complex &b) const{return Complex(x+b.x,y+b.y);}
    Complex operator - (const Complex &b) const{return Complex(x-b.x,y-b.y);}
    Complex operator * (const Complex &b) const{return Complex(x*b.x-y*b.y,x*b.y+y*b.x);}
}a[N],b[N],c[N];
int len,len1,len2,top,n;
char s1[N],s2[N];
int pos[N],f[N],g[N],s[N];
inline int trans(char c){
    if(c=='*') return 0;
    return c-'a'+1;
}
inline void FFT(Complex a[],double mode){
    for(int i=0;i<len;i++)
        if(i<pos[i])
            swap(a[i],a[pos[i]]);
    for(int i=2,mid=1;i<=len;i<<=1,mid<<=1){
        Complex wm(cos(2.0*pi/i),sin(mode*pi/i));
        for(int j=0;j<len;j+=i){
            Complex w(1,0);
            for(int k=j;k<j+mid;k++,w=w*wm){
                Complex l=a[k],r=w*a[k+mid];
                a[k]=l+r;a[k+mid]=l-r;
            }
        }
    }
    if(mode==IDFT)
        for(int i=0;i<len;i++)
            a[i].x/=len;
    return;
}
int main(){
    scanf("%d%d",&len2,&len1);
    scanf("%s%s",s2,s1);
    n=len1+len2-1;
    for(len=1;len<=n<<1;len<<=1);
    for(int i=0;i<len;i++){
        pos[i]=pos[i>>1]>>1;
        if(i&1) pos[i]|=len>>1;
    }
    for(int i=0;i<len1;i++) f[i]=trans(s1[i]);
    for(int i=0;i<len2;i++) g[len2-i-1]=trans(s2[i]);
    for(int i=0;i<len;i++)
        a[i]=Complex(f[i]*f[i]*f[i],0),b[i]=Complex(g[i],0);
    FFT(a,DFT);FFT(b,DFT);
    for(int i=0;i<len;i++) c[i]=a[i]*b[i];
    for(int i=0;i<len;i++)
        a[i]=Complex(2*f[i]*f[i],0),b[i]=Complex(g[i]*g[i],0);
    FFT(a,DFT);FFT(b,DFT);
    for(int i=0;i<len;i++) c[i]=c[i]-a[i]*b[i];
    for(int i=0;i<len;i++)
        a[i]=Complex(f[i],0),b[i]=Complex(g[i]*g[i]*g[i],0);
    FFT(a,DFT);FFT(b,DFT);
    for(int i=0;i<len;i++) c[i]=c[i]+a[i]*b[i];
    FFT(c,IDFT);
    for(int i=len2-1;i<len1;i++)
        if(c[i].x<0.5)
            s[++top]=i-len2+1;
    printf("%d\n",top);
    for(int i=1;i<=top;i++) printf("%d ",s[i]+1);
    return 0;
}