UVALive - 4671 K-neighbor substrings

题解：FFT处理子串相应位置上不同字符的个数。字符串hash处理相同的子串

#include"bits/stdc++.h"
#define debug(x) cout<<#x<<" = "<<x<<"  "
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int MX = 1e5+17;

bool isprime[MX];
int prime[MX],mu[MX]= {0,1};

const double pi = acos (-1.0);
const int MM = MX * 4;
int len, res[MM], mx; //开大4倍
char a[MX],b[MX];
int A[MX],B[MX];

struct cpx {
    double r, i;
    cpx (double r = 0, double i = 0) : r (r), i (i) {};
    cpx operator+ (const cpx &b) {return cpx (r + b.r, i + b.i);}
    cpx operator- (const cpx &b) {return cpx (r - b.r, i - b.i);}
    cpx operator* (const cpx &b) {return cpx (r*b.r - i*b.i,i*b.r + r * b.i);}
} va[MM], vb[MM];
void rader (cpx F[], int len) { //len = 2^M,reverse F[i] with  F[j] j为i二进制反转
    int j = len >> 1;
    for (int i = 1; i < len - 1; ++i) {
        if (i < j) swap (F[i], F[j]); // reverse
        int k = len >> 1;
        while (j >= k) j -= k, k >>= 1;
        if (j < k) j += k;
    }
}
void FFT (cpx F[], int len, int t) {
    rader (F, len);
    for (int h = 2; h <= len; h <<= 1) {
        cpx wn (cos (-t * 2 * pi / h), sin (-t * 2 * pi / h) );
        for (int j = 0; j < len; j += h) {
            cpx E (1, 0); //旋转因子
            for (int k = j; k < j + h / 2; ++k) {
                cpx u = F[k];
                cpx v = E * F[k + h / 2];
                F[k] = u + v;
                F[k + h / 2] = u - v;
                E = E * wn;
            }
        }
    }
    if (t == -1) //IDFT
        for (int i = 0; i < len; ++i) F[i].r /= len;
}
void Conv (cpx a[], cpx b[], int len) { //求卷积
    FFT (a, len, 1);
    FFT (b, len, 1);
    for (int i = 0; i < len; ++i) a[i] = a[i] * b[i];
    FFT (a, len, -1);
}
void gao (int n, int m) {
    len = 1;
    mx = n + m;
    while (len <= mx) len <<= 1; //mx为卷积后最大下标
    for (int i = 0; i < len; i++) va[i].r =va[i].i = vb[i].r = vb[i].i = 0;
    for (int i = 0; i < n; i++) va[i].r = A[i];//根据题目要求改写
    for (int i = 0; i < m; i++) vb[i].r = B[i];//根据题目要求改写
    Conv (va, vb, len);
    for (int i = 0; i < len; ++i) res[i] += va[i].r + 0.5;
}

ULL H[MX], P[MX];  //直接乘爆冲突概率较大,mod一个大质数
const int PA = 131; //163, 233, 99959
const LL MOD = 100001651; //100001611,1e9+7
ULL mod = 212370440130137957ll;
unordered_map<ULL, bool> mp;
//预处理整段长度
//下标从1开始
void Hash(int n, char str[]) {
    H[0] = n; //任意选一个值就好
    P[0] = 1;
    for (int i = 1; i <= n; i++) {
        H[i] = H[i - 1] * PA + str[i-1] - 'a' + 1;
        P[i] = P[i - 1] * PA;
    }
}
//获得l,r之间字符串的hash值
ULL code (int l, int r) {
    return H[r] - H[l - 1] * P[r - l + 1];
}

void solve(int K)
{
    scanf("%s%s",a,b);
    int n1 = strlen(a), n2 = strlen(b);
    for(int i = 0; i <= n1+n2; i++) res[i] = 0;
    for(int i = 0; i < n1; i++){
        if(a[i] == 'a') A[n1-i-1] = 1;
        else A[n1-i-1] = 0;
    }
    for(int i = 0; i < n2; i++){
        if(b[i] == 'b') B[i] = 1;
        else B[i] = 0;
    }
    gao(n1,n2);

    for(int i = 0; i < n1; i++){
        if(a[i] == 'b') A[n1-i-1] = 1;
        else A[n1-i-1] = 0;
    }
    for(int i = 0; i < n2; i++){
        if(b[i] == 'a') B[i] = 1;
        else B[i] = 0;
    }
    gao(n1,n2);

    mp.clear();
    Hash(n1,a);
    int ans = 0,l = n1-n2+1;
    for(int i = n2-1; i < n1; i++,l--){
        ULL cd = code(l,l+n2-1);
        if(res[i] <= K && !mp.count(cd))
            ans++;
        if(!mp.count(cd)) mp[cd] = 1;
    }
    cout<<ans<<endl;
}

int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
#endif // LOCAL
    int K,T,cas = 0;
    while(scanf("%d",&K) && K >= 0){
        printf("Case %d: ",++cas);
        solve(K);
    }
    return 0;
}