Description
Solution
想不到。。
首先肯定要排序,不排序是不可能的。记r[i]表示a[i]最多能匹配多少个b
设f[i,j]表示a的前i个匹配了j个,转移就有f[i,j]=f[i-1,j]+f[i-1,j-1]*(r[i]-j+1)
然后这样是会算重的,直接输出就挂了。我们需要一个小容斥来去重
记g[i]表示匹配了恰好i个的答案,那么
g
[
i
]
=
f
[
n
]
[
i
]
⋅
(
n
−
i
)
!
−
∑
j
=
i
+
1
n
g
[
j
]
⋅
(
j
i
)
g[i]=f[n][i]\cdot(n-i)!-\sum\limits_{j=i+1}^{n}{g[j]\cdot\binom{j}{i}}
g[i]=f[n][i]⋅(n−i)!−j=i+1∑ng[j]⋅(ij)
Code
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (register int i=st;i<=ed;++i)
#define drp(i,st,ed) for (register int i=st;i>=ed;--i)
typedef long long LL;
const int MOD=1000000009;
const int N=2005;
LL f[N][N],g[N],fac[N],inv[N];
int a[N],b[N],r[N];
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
bool cmp(int a,int b) {
return a>b;
}
int main(void) {
int n=read(),m=read();
if ((n+m)&1) return 0&puts("0");
m=(n+m)>>1;
fac[0]=fac[1]=1; rep(i,2,N-1) fac[i]=fac[i-1]*i%MOD;
inv[0]=inv[1]=1; rep(i,2,N-1) inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
rep(i,2,N-1) inv[i]=inv[i-1]*inv[i]%MOD;
rep(i,1,n) a[i]=read();
rep(i,1,n) b[i]=read();
std:: sort(a+1,a+n+1);
std:: sort(b+1,b+n+1);
rep(i,1,n) {
r[i]=r[i-1];
while (r[i]+1<=n&&b[r[i]+1]<a[i]) r[i]++;
}
f[0][0]=1;
rep(i,1,n) rep(j,0,i) {
f[i][j]=(f[i-1][j]+f[i-1][j-1]*std:: max(0,r[i]-j+1))%MOD;
}
drp(i,n,m) {
g[i]=f[n][i]*fac[n-i]%MOD;
rep(j,i+1,n) g[i]=(g[i]-g[j]*fac[j]%MOD*inv[i]%MOD*inv[j-i]%MOD)%MOD;
g[i]=(g[i]%MOD+MOD)%MOD;
}
printf("%lld\n", (g[m]%MOD+MOD)%MOD);
return 0;
}