E. Another Filling the Grid
题意:
输入
n
(
250
)
,
k
(
1
e
9
)
n(250),k(1e9)
n(250),k(1e9)
将
1
−
k
1-k
1−k填入
n
×
n
n\times n
n×n的矩阵,问多少种方案可以使每行每列都有1.
题解:
设 d p [ i ] [ j ] dp[i][j] dp[i][j]为到第 i i i行,有 j j j列为1且第 i i i行至少有1个1的状态,然后转移就好。
代码:
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
//#define int ll
#define ll long long
const int mod=1e9+7;
int n,k;
int dp[299][299];
int fac[299],inv[299];
const int N=299;
void init(){
fac[0]=inv[0]=fac[1]=inv[1]=1;
for(int i=2;i<N;i++)fac[i]=1ll*i*fac[i-1]%mod,inv[i]=(mod-mod/i)*1ll*inv[mod%i]%mod;
for(int i=2;i<N;i++)inv[i]=1ll*inv[i]*inv[i-1]%mod;
}
int C(int a,int b){return 1ll*fac[a]*inv[b]%mod*inv[a-b]%mod;}
int poww(int a,int b,int c){
int ans=1,base=a;
while(b){
if(b&1)ans=1ll*ans*base%c;
base=1ll*base*base%c;
b>>=1;
}
return ans;
}
int f[299],g[299];
signed main(){
///freopen("tt.in","r",stdin),freopen("tt.out","w",stdout);
cin>>n>>k;
init();
dp[0][0]=1;
f[0]=g[0]=1;
for(int i=1;i<=n;i++)f[i]=1ll*f[i-1]*k%mod,g[i]=1ll*g[i-1]*(k-1)%mod;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
int dc=poww(k-1,n-j,mod);
for(int kk=0;kk<=j;kk++)dp[i][j]=(dp[i][j]+1ll*dp[i-1][kk]*C(n-kk,j-kk)%mod*g[n-j]%mod*(f[kk]+mod-(j==kk)*g[kk]%mod))%mod;
// printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);
}
cout<<dp[n][n]<<endl;
return 0;
}