题目描述
题解
首先判断是否有解,也就是(n+k)/2 mod 2=0
这样的话也就相当于糖比药大的正好有(n+k)/2组
然后剩下的和BZOJ2024就一样了
dpf(i,j)表示前i个糖选出了j个并且比配对的药大的方案数
答案就是强制满足k个-强制满足k+1个+强制满足k+2个…
就是容斥一下,每一次将没选的乘上阶乘(表示任意配对个数),容斥系数是
Cki
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define Mod 1000000009
#define LL long long
#define N 2005
int n,k,a[N],b[N];
LL ans,mul[N],c[N][N],f[N][N];
int main()
{
scanf("%d%d",&n,&k);
if ((n+k)&1)
{
puts("0");
return 0;
}
k=(n+k)>>1;
mul[0]=1;for (int i=1;i<=n;++i) mul[i]=mul[i-1]*(LL)i%Mod;
for (int i=0;i<=n;++i) c[i][0]=1;
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
c[i][j]=(c[i-1][j]+c[i-1][j-1])%Mod;
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
for (int i=1;i<=n;++i) scanf("%d",&b[i]);
sort(a+1,a+n+1);sort(b+1,b+n+1);
int now=0;
for (int i=0;i<=n;++i) f[i][0]=1;
for (int i=1;i<=n;++i)
{
while (now<n&&b[now+1]<a[i])
++now;
for (int j=1;j<=i;++j)
{
f[i][j]=f[i-1][j];
f[i][j]+=f[i-1][j-1]*(now-j+1)%Mod;
f[i][j]%=Mod;
}
}
for (int i=k,opt=1;i<=n;++i,opt=-opt)
{
ans+=f[n][i]*mul[n-i]%Mod*c[i][k]*opt%Mod;
ans=(ans%Mod+Mod)%Mod;
}
printf("%lld\n",ans);
}