「BZOJ3160」万径人踪灭-FFT+Manacher

Decription

要求在只含$a,b$的字符串中选取一个子序列,使得:

1. 位置和字符都关于某条对称轴对称.
2. 不能是连续的一段.

Solution

可以求出所有满足条件1的子序列,然后去掉不满足条件2的部分(回文串).

设$f_i$表示以$i$为对称轴的合法子序列方案数.

可以发现$f_i=2^{(\sum s_{i-x}=s_{i+x})}-1$

所以对于$a,b$分开考虑,每次将$a$或$b$的位置置为$1$,$FFT$即可.

#include <bits/stdc++.h>
using namespace std;

typedef complex<double> cpx;
typedef long long lint;
const double pi = acos(-1);
const int maxn = 270005, mod = 1e9 + 7;

int n, m, L, R[maxn], f[maxn], ans;
char s[maxn], a[maxn];
cpx A[maxn];

inline int gi()
{
    char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    int sum = 0;
    while ('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
    return sum;
}

int Manacher()
{
    int ans = 0, len = 1;
    a[len] = '$';
    for (int i = 1; i <= n; ++i) a[++len] = s[i], a[++len] = '$';
    for (int i = 1, pos, r = 0; i <= len; ++i) {
        if (i < r) f[i] = min(r - i, f[(pos << 1) - i]);
        while (i - f[i] && i + f[i] <= len && a[i - f[i]] == a[i + f[i]]) ++f[i];
        if (f[i] + i > r) pos = i, r = f[i] + i;
        ans += f[i] >> 1;
        if (ans >= mod) ans -= mod;
    }
    return ans;
}

void fft(cpx *a, int f)
{
    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) {
        cpx wn(cos(pi / i), sin(f * pi / i)), t;
        for (int j = 0; j < n; j += (i << 1)){
            cpx w(1, 0);
            for (int k = 0; k < i; ++k, w *= wn) {
                t = a[j + i + k] * w;
                a[j + i + k] = a[j + k] - t;
                a[j + k] = a[j + k] + t;
            }
        }
    }
}

void calc()
{
    fft(A, 1);
    for (int i = 0; i < n; ++i) A[i] *= A[i];
    fft(A, -1);
    for (int i = 1; i <= m; ++i) f[i] += ((lint)(A[i].real() / n + 0.5) + 1) >> 1;
}

int Pow(int x, int k)
{
    int res = 1;
    while (k) {
        if (k & 1) res = (lint)res * x % mod;
        x = (lint)x * x % mod; k >>= 1;
    }
    return res;
}

int main()
{
    freopen("path.in", "r", stdin);
    freopen("path.out", "w", stdout);

    scanf("%s", s + 1); n = strlen(s + 1);

    ans = -Manacher();

    memset(f, 0, sizeof(f));
    for (m = (n << 1), n = 1; n <= m; n <<= 1) ++L;
    for (int i = 0; i < n; ++i) R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
    for (int i = 0; i < n; ++i) A[i] = s[i] == 'a';
    calc();
    for (int i = 0; i < n; ++i) A[i] = s[i] == 'b';
    calc();

    for (int i = 1; i <= m; ++i)
        (ans += Pow(2, f[i]) - 1) %= mod;
    printf("%d\n", (ans + mod) % mod);

    return 0;
}