bzoj4503两个串 快速傅里叶变换（FFT）

题目传送门：bzoj4503

题目大意：给出两个串S和T，T中有通配符（可以与任意字符匹配），求T在S中匹配的次数及位置。

题目一看，怎么做啊，kmp？AC自动机？好像很困难啊。
但是，我们转换一下思路。我们定义$c_k = \Sigma_{i = 0}^{k} (S_i - T_{k - i} ) ^ 2*T_{k - i}$。当且仅当$c_k == 0$的时候，它是匹配结束的位置。如果觉得表达式不直观的话，将其展开可以清晰的看到其对应关系。打开括号后我们发现，当把T串反转以后，就可以通过两次FFT来求得其卷积。对于问号，我们只要将其置为0即可。

然后精度挂了WA到死QAQ。换成long double就过了， 惨。

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <iostream>
using namespace std;

const int MAXN = 300003;
const long double pi = acos(-1.0);
struct comp {
    long double x, y;
    comp(long double _x = 0, long double _y = 0):x(_x), y(_y) {}
    comp operator + (const comp& a) { return comp(x + a.x, y + a.y); }
    comp operator - (const comp& a) { return comp(x - a.x, y - a.y); }
    comp operator * (const comp& a) { return comp(x * a.x - y * a.y, x * a.y + y * a.x); }
};

int rev[MAXN], T;
comp Sin[MAXN], tmp;
void fft(comp *a) {
    for(int i = 1; i < T; i++) if(rev[i] > i) swap(a[rev[i]], a[i]);
    for(int i = 2, mid = 1, s = (T >> 1); i <= T; mid = i, i <<= 1, s >>= 1) {
        for(int j = 0; j < T; j += i) {
            for(int k = j, cur = 0; k < j + mid; k++, cur += s) {
                tmp = a[k + mid] * Sin[cur];
                a[k + mid] = a[k] - tmp;
                a[k] = a[k] + tmp;
            }
        }
    }
}

int n, m;
void init() {
    for(T = 1; T <= (n << 1); T <<= 1);
    for(int i = 0; i < T; i++) {
        if(i & 1) rev[i] = (rev[i >> 1] >> 1) ^ (T >> 1);
        else rev[i] = rev[i >> 1] >> 1;
    }
    Sin[0] = comp(1, 0); Sin[1] = comp(cos(2 * pi / T), sin(2 * pi / T));
    for(int i = 2; i < (T >> 1); i++) Sin[i] = Sin[i - 1] * Sin[1];
}

comp A[MAXN], B[MAXN];
char s1[MAXN], s2[MAXN];
long double c[MAXN];
vector<int> ans;

int main() {
    scanf("%s%s", s1, s2);
    n = (int)strlen(s1) - 1; m = (int)strlen(s2) - 1;
    reverse(s2, s2 + m + 1);
    for(int i = 0; i <= m; i++) if(s2[i] == '?') s2[i] = 0;
    for(int i = 0; i <= n; i++) {
        A[i].x = s1[i] * s1[i];
        A[i].y = s2[i];
        B[i].x = s1[i];
        B[i].y = s2[i] * s2[i];
        c[i] = s2[i] * s2[i] * s2[i] + c[i - 1];
    }
    init();
    fft(A); fft(B);
    for(int i = 0; i < T; i++) {
        A[i] = A[i] * A[i];
        B[i] = B[i] * B[i];
    }
    for(int i = 0; i < (T >> 1); i++) Sin[i].y = -Sin[i].y;
    fft(A); fft(B);
    for(int i = 0; i < T; i++)
        c[i] = A[i].y / T / 2 - B[i].y / T + c[i];
    for(int i = 0; i <= n; i++) if(i - m >= 0 && fabs(c[i]) < 0.3) ans.push_back(i - m);
    printf("%d\n", (int)ans.size());
    for(int i = 0; i < (int)ans.size(); i++) printf("%d\n", ans[i]);
    return 0;
}