[HDU 6314] Matrix

HDU 6314

题解

写完后看了眼题解，发现题解不靠谱.

$f_{a,j}=1-\sum_{k=a}^{j-1} C_j^k$

此处应为 $f_{a,j}=1-\sum_{k=a}^{j-1} f_{a,k}C_j^k$

​​代码：

#include<bits/stdc++.h>
#define LL long long
#define ull unsigned long long
#define ULL ull
#define mp make_pair
#define pii pair<int,int>
#define piii pair<int, pii >
#define pll pair <ll,ll>
#define pb push_back
#define big 20160116
#define INF 2147483647
#define pq priority_queue
#define rank rk124232
#define y1 y20160116
#define y0 y20160110
using namespace std;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while (ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
namespace Mymath{
    LL qp(LL x,LL p,LL mod){
        LL ans=1;
        while (p){
            if (p&1) ans=ans*x%mod;
            x=x*x%mod;
            p>>=1;
        }
        return ans;
    }
    LL inv(LL x,LL mod){
        return qp(x,mod-2,mod);
    }
    LL C(LL N,LL K,LL fact[],LL mod){
        return fact[N]*inv(fact[K],mod)%mod*inv(fact[N-K],mod)%mod;
    }
    template <typename Tp> Tp gcd(Tp A,Tp B){
        if (B==0) return A;
        return gcd(B,A%B);
    }
    template <typename Tp> Tp lcm(Tp A,Tp B){
        return A*B/gcd(A,B);
    }
};
namespace fwt{
    using namespace Mymath;
    void FWT(int a[],int n,LL mod)
    {
        for(int d=1;d<n;d<<=1)
            for(int m=d<<1,i=0;i<n;i+=m)
                for(int j=0;j<d;j++)
                {
                    int x=a[i+j],y=a[i+j+d];
                    a[i+j]=(x+y)%mod,a[i+j+d]=(x-y+mod)%mod;
                    //xor:a[i+j]=x+y,a[i+j+d]=x-y;
                    //and:a[i+j]=x+y;
                    //or:a[i+j+d]=x+y;
                }
    }

    void UFWT(int a[],int n,LL mod)
    {
        LL rev=inv(2,mod);
        for(int d=1;d<n;d<<=1)
            for(int m=d<<1,i=0;i<n;i+=m)
                for(int j=0;j<d;j++)
                {
                    int x=a[i+j],y=a[i+j+d];
                    a[i+j]=1LL*(x+y)*rev%mod,a[i+j+d]=(1LL*(x-y)*rev%mod+mod)%mod;
                    //xor:a[i+j]=(x+y)/2,a[i+j+d]=(x-y)/2;
                    //and:a[i+j]=x-y;
                    //or:a[i+j+d]=y-x;
                }
    }
    void solve(int a[],int b[],int n,LL mod)
    {
        FWT(a,n,mod);
        FWT(b,n,mod);
        for(int i=0;i<n;i++) a[i]=1LL*a[i]*b[i]%mod;
        UFWT(a,n,mod);
    }
};
const int Maxn=3005;
int n,m,a,b;
const LL mod=998244353;
LL fact[Maxn];
LL ivfact[Maxn];
using namespace Mymath;
LL c[Maxn][Maxn];
LL S[Maxn][Maxn];
LL F[Maxn][Maxn];
LL p2[Maxn*Maxn];
void _init(){
    fact[0]=1;
    ivfact[0]=1;
    for (int i=1;i<Maxn;i++){
        fact[i]=fact[i-1]*i%mod;
        ivfact[i]=inv(fact[i],mod);
    }
    for (int i=0;i<Maxn;i++){
        for (int j=0;j<=i;j++){
            c[i][j]=fact[i]*ivfact[j]%mod*ivfact[i-j]%mod;
        }
    }
    for (int i=0;i<Maxn;i++){
        S[i][0]=c[i][0];
        for (int j=1;j<=i;j++){
            S[i][j]=S[i][j-1]+c[i][j];
            if (S[i][j]>=mod) S[i][j]-=mod;
        }
    }
    p2[0]=1;
    for (int i=1;i<Maxn*Maxn;i++) p2[i]=p2[i-1]*2%mod;
}
LL ca[Maxn],cb[Maxn]; 
void mian(){
    if (a>n || b>m){
        printf("0\n");
        return;
    }
    LL ans=0;
    for (int i=a;i<=n;i++){
        F[a][i]=1;
        for (int j=i-1;j>=a;j--){
            F[a][i]-=F[a][j]*c[i][j];
            F[a][i]%=mod;
        }
        F[a][i]=(F[a][i]%mod+mod)%mod;
        ca[i]=F[a][i]*c[n][i]%mod;
    }
    for (int i=b;i<=m;i++){
        F[b][i]=1;
        for (int j=i-1;j>=b;j--){
            F[b][i]-=F[b][j]*c[i][j];
            F[b][i]%=mod;
        }
        F[b][i]=(F[b][i]%mod+mod)%mod;
        cb[i]=F[b][i]*c[m][i]%mod;
    }
    for (int i=a;i<=n;i++){
        LL coef=ca[i];
        LL s=0;
        for (int j=b;j<=m;j++){
            s+=cb[j]*p2[(n-i)*(m-j)];
            s%=mod;
        }
        ans+=coef*s;
        ans%=mod;
    }
    printf("%I64d\n",ans);
}
int main(){
    _init();
    while (~scanf("%d %d %d %d",&n,&m,&a,&b)){
        mian();
    }
}