5372: [Pkusc2018]神仙的游戏

这题务必用fft写，反正ntt我bzoj一直tle，loj 8s

做这题首先要知道一个性质，如果选取长度为len的串，那么该串可行，一定满足不存在一对 01，其距离相差len
（X而不是一开始我想的类似 另外一个fft的题…
那么如果存在一对01其距离差为len,那么对于所有k|len的串都不可行。
考虑首先求出所有01串的差值len， 暴力n^2肯定不行
考虑两个数组a,b，若s[i] = 0则 a[i] = 1,否则 b[i] = 1
那么对于两个位置 a[i] = 1, b[j] = 1,abs(j - i)就是一个不合法情况
考虑用fft怎么优化，容易知道令$a[i] = a[i] * x^i b[i] = b[i] * x^i$
那么 $a[i] * b[j] = a[i] * b[j] * x^{i+j}$
而想要的到的是 i-j,那么考虑把其中一个数组反转，即 j变为 n-j+1
那么此时转化为$a[i] * b[n-j+1] = a[i] * b[j] * x^{i+n-j+1}$
那么这个时候很显然fft能直接优化了，搞定
复杂度$O(n\log n)$
fft:

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y; ++ i )
#define repd(i,x,y) for(register int i = x; i >= y; -- i )
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int g = 3,p = 998244353,N = 2e6 + 50;
bool c[N],d[N];
int n,L,R[N];
char s[N];ll ans;

struct cpx
{
    double a,b;
    cpx(){}
    cpx(double x,double y) { a = x,b = y;}

    cpx operator * (cpx y){ return cpx(a * y.a - b * y.b,a * y.b + b * y.a); }
    cpx operator *= (cpx y){ *this = *this * y; }
    cpx operator - (cpx y) { return cpx(a - y.a,b - y.b); }
    cpx operator + (cpx y) { return *this - (cpx(0,0) - y); }

}a[N],b[N];

#define PI acos(-1)
void fft(cpx*a,int f)
{
    rep(i,0,n-1) if(i < R[i]) swap(a[i],a[R[i]]);
    for(register int i = 1;i < n;i <<= 1)
    {
        cpx wn = cpx(cos(PI/i),f*sin(PI/i));
        for(register int j = 0;j < n; j += i<<1)
        {
            cpx w = cpx(1,0);
            for(register int k = 0;k < i; ++ k, w *= wn)
            {
                cpx x = a[j + k],y = a[i + j + k]*w;
                a[j + k] = x + y;
                a[i + j + k] = x - y;
            }
        }
    }
    if(f == -1) rep(i,0,n-1) a[i].a /= n;
}
int main()
{
    scanf("%s",s + 1);
    n = strlen(s + 1);  

    rep(i,1,n) a[i].a = s[i] == '0';
    rep(i,1,n) b[i].a = s[n-i+1] == '1';

    int m = n << 1;
    for(n = 1;n <= m; n <<= 1,++L);
    rep(i,0,n-1) R[i] = ((R[i>>1]>>1)|((i&1) << (L - 1)));

    fft(a,1); fft(b,1);
    rep(i,0,n-1) a[i] *= b[i];
    fft(a,-1);

    m >>= 1;
    rep(i,0,n - 1) if(a[i].a > 0.1) c[abs(i - m - 1)] = 1;

    repd(i,m,0)
        if(c[i] && !d[i])
        {
            int k = sqrt(i);
            rep(j,1,k)
                if(i % j == 0)
                    c[j] = d[j] = 1,d[i/j] = c[i / j] = 1;
        }else if(!c[i]) ans ^= 1ll * (m-i) * (m-i);

    cout << ans << endl;

    return 0;
}

ntt:

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y; ++ i )
#define repd(i,x,y) for(register int i = x; i >= y; -- i )
typedef long long ll;
using namespace std;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int g = 3,p = 998244353,N = 2e6 + 50;
int a[N],b[N];bool c[N],d[N];
int n,L,R[N];
char s[N];ll ans;

inline int ksm(int x,int y)
{
    int ans = 1;
    while(y)
    {
        if(y&1) ans = 1ll * ans * x % p;
        y >>= 1; x = 1ll * x * x % p;
    }
    return ans;
}

void ntt(int*a,int f)
{
    rep(i,0,n-1) if(i < R[i]) swap(a[i],a[R[i]]);
    for(register int i = 1;i < n;i <<= 1)
    {
        int wn = ksm(g,(p-1)/(i<<1));
        if(f==-1) wn = ksm(wn,p-2);
        for(register int j = 0;j < n; j += i<<1)
        {
            int w = 1;
            for(register int k = 0;k < i; ++ k, w = 1ll*w*wn%p)
            {
                int x = a[j + k],y = 1ll*a[i + j + k]*w%p;
                a[j + k] = (x + y) % p;
                a[i + j + k] = ((x - y) % p + p) % p;
            }
        }
    }
    if(f == -1)
    {
        int inv = ksm(n,p-2);
        rep(i,0,n-1) a[i] = 1ll*a[i]*inv%p;
    }
}

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

    rep(i,1,n) a[i] = s[i] == '0';
    rep(i,1,n) b[i] = s[n-i+1] == '1';

    int m = n << 1;
    for(n = 1;n <= m; n <<= 1,++L);
    rep(i,0,n-1) R[i] = ((R[i>>1]>>1)|((i&1) << (L - 1)));

    ntt(a,1); ntt(b,1);
    rep(i,0,n-1) a[i] = 1ll*a[i] * b[i] % p;
    ntt(a,-1);

    m >>= 1;
    rep(i,0,n - 1) if(a[i]) c[abs(i - m - 1)] = 1;

    repd(i,m,0)
        if(c[i] && !d[i])
        {
            int k = sqrt(i);
            rep(j,1,k)
                if(i % j == 0)
                    c[j] = d[j] = 1,d[i/j] = c[i / j] = 1;
        }else if(!c[i]) ans ^= 1ll * (m-i) * (m-i);

    cout << ans << endl;

    return 0;
}