洛谷P5387 [Cnoi2019]人形演舞

链接

点击跳转

题解

这题应该是数据错了，而且感觉我写的没啥毛病

找规律求出$sg$函数，然后统计每种函数值的出现次数，搞一个生成函数，做多项式异或卷积快速幂，然后统计一下答案就好了

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 2000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl;
#define mod 998244353ll
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct EasyMath
{
    ll prime[maxn];
    bool mark[maxn];
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
    void get_prime(ll N)
    {
        ll i, j;
        for(i=2;i<=N;i++)mark[i]=false;
        *prime=0;
        for(i=2;i<=N;i++)
        {
            if(!mark[i])prime[++*prime]=i;
            for(j=1;j<=*prime and i*prime[j]<=N;j++)
            {
                mark[i*prime[j]]=true;
                if(i%prime[j]==0)break;
            }
        }
    }
}em;
struct FWT
{
    ll a[maxn], n;
    void init(ll N)
    {
        for(n=1;n<=N;n<<=1);
        for(ll i=0;i<n;i++)a[i]=0;
    }
    void fwt(ll opt)
    {
        ll inv2=em.fastpow(2,mod-2,mod);
        for(ll i=1;i<n;i<<=1)
            for(ll p=i<<1,j=0;j<n;j+=p)
                for(ll k=0;k<i;++k)
                {
                    ll x=a[j+k], y=a[i+j+k];
                    a[j+k]=(x+y)%mod, a[i+j+k]=(x-y)%mod;
                    if(opt==-1)a[j+k]=a[j+k]*inv2%mod, a[i+j+k]=a[i+j+k]*inv2%mod;
                }
    }
}v;
ll sg[maxn], V, m;
int main()
{
    ll i, y, ans=0;
    rep(i,1000000)
        if(i==(i&-i))sg[i]=1;
        else sg[i]=sg[i-1]+1;
    ll mx=0;
    V=read(), m=read();
    v.init(1000000);
    rep(i,m)v.a[sg[i]]++;
    v.fwt(1);
    for(i=0;i<v.n;i++)v.a[i]=em.fastpow(v.a[i],V%(mod-1),mod);
    v.fwt(-1);
    rep(i,1048576)(ans+=v.a[i])%=mod;
    cout<<(ans+mod)%mod;
    return 0;
}