bzoj 4259: 残缺的字符串 （FFT）

题目描述

传送门

题目大意：给出两个带通配符的字符串，求匹配的个数。

题解

FFT裸题，通配符的位置赋值成0
$f[i]=\sum\limits_{j=1}^n (g[j]-h[i-j])^2*g[j]*h[i-j]$
这个式子拆开后，做三次FFT就可以了

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define N 2000003
#define pi acos(-1)
#define LL long long 
using namespace std;
int a[N],b[N],n,m,n1,L,R[N],len;
LL ans[N];
char s[N];
struct data{
    double x,y;
    data (double X=0,double Y=0) {
        x=X,y=Y;
    }
}f[N],g[N];
data operator +(data a,data b) {
    return data(a.x+b.x,a.y+b.y);
}
data operator -(data a,data b){
    return data(a.x-b.x,a.y-b.y);
}
data operator *(data a,data b){
    return data(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);
}
double pow1(double x)
{
    return x*x*x;
}
void FFT(data a[N],int n,int opt)
{
    for (int i=0;i<n;i++)
     if (i>R[i]) swap(a[i],a[R[i]]);
    for (int i=1;i<n;i<<=1) {
        data wn=data(cos(pi/i),opt*sin(pi/i));
        for (int p=i<<1,j=0;j<n;j+=p) {
            data w=data(1,0);
            for (int k=0;k<i;k++,w=w*wn) {
                data x=a[j+k]; data y=w*a[j+k+i];
                a[j+k]=x+y; a[j+k+i]=x-y;
            }
        } 
    } 
    if (opt==-1) for (int i=0;i<n;i++) a[i].x/=n;
}
int main()
{
    freopen("a.in","r",stdin);
    freopen("my.out","w",stdout);
    scanf("%d%d",&n,&m); n--; m--;
    scanf("%s",s);
    for (int i=0;i<=n;i++) 
     if (s[i]=='*') a[n-i]=0;
     else a[n-i]=s[i]-'a'+1;
    scanf("%s",s);
    for (int i=0;i<=m;i++) 
     if (s[i]=='*') b[i]=0;
     else b[i]=s[i]-'a'+1;
    len=n+m;
    for (n1=1;n1<=len;n1<<=1) L++;
    //for (int i=0;i<=n1;i++) 
    // R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    for (int i=0;i<n1;i++) R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    for (int i=0;i<=n;i++) f[i].x=pow1(a[i]),f[i].y=0;
    for (int i=0;i<=m;i++) g[i].x=b[i],g[i].y=0;
    FFT(f,n1,1); FFT(g,n1,1);
    for (int i=0;i<=n1;i++) 
      f[i]=f[i]*g[i];
    FFT(f,n1,-1);
    //for (int i=0;i<=n1;i++) cout<<(LL)(f[i].x+0.5)<<" "; cout<<endl;
    for (int i=0;i<=n1;i++) ans[i]+=(LL)(f[i].x+0.5);
    for (int i=0;i<=n1;i++) f[i].x=a[i],f[i].y=0;
    for (int i=0;i<=n1;i++) g[i].x=pow1(b[i]),g[i].y=0;
    FFT(f,n1,1); FFT(g,n1,1);
    for (int i=0;i<=n1;i++) f[i]=f[i]*g[i];
    FFT(f,n1,-1);
    //for (int i=0;i<=n1;i++) cout<<(LL)(f[i].x+0.5)<<" "; cout<<endl;
    for (int i=0;i<=n1;i++) ans[i]+=(LL)(f[i].x+0.5);
    for (int i=0;i<=n1;i++) f[i].x=a[i]*a[i],f[i].y=0;
    for (int i=0;i<=n1;i++) g[i].x=b[i]*b[i],g[i].y=0;
    FFT(f,n1,1); FFT(g,n1,1);
    for (int i=0;i<=n1;i++) f[i]=f[i]*g[i];
    FFT(f,n1,-1);
    //for (int i=0;i<=n1;i++) cout<<(LL)(f[i].x+0.5)<<" "; cout<<endl;
    for (int i=0;i<=n1;i++) ans[i]-=(LL)2*(LL)(f[i].x+0.5);
    //for (int i=0;i<=m;i++) cout<<ans[i]<<" ";
    //cout<<endl;
    int cnt=0;
    for (int i=n;i<=m;i++)
     if (ans[i]==0) cnt++;
    printf("%d\n",cnt);
    for (int i=n;i<=m;i++)
     if (ans[i]==0) printf("%d ",i-n+1);
    printf("\n");
}