Description
Solution
先将
{ai},{bi}
{
a
i
}
,
{
b
i
}
排序,求出
ti
t
i
,表示有多少个
bj
b
j
小于
ai
a
i
。
设
dpi,j
d
p
i
,
j
为
a
a
中的前个有
j
j
个大于,得到转移方程:
设 fi f i 为等于 i i 组的方案数,为不小于 i i 组的方案数,已知:
由二项式反演得:
Source
/****************************
* Happy Spring Festival !
* Au: Hany01
* Prob: [BZOJ3622] 已经没有什么好害怕的了
* Date: Feb 16th, 2018
* Email: hany01@foxmail.com
****************************/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define rep(i , j) for (int i = 0 , i##_end_ = j; i < i##_end_ ; ++ i)
#define For(i , j , k) for (int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , i##_end_ = (k) ; i >= i##_end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000009)
#define y1 wozenmezhemecaia
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif
inline void File() {
#ifdef hany01
freopen("bzoj3622.in" , "r" , stdin);
freopen("bzoj3622.out" , "w" , stdout);
#endif
}
template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }
inline int read() {
register char c_; register int _ , __;
for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-') __ = -1;
for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
return _ * __;
}
const int maxn = 2005;
int n, k, C[maxn][maxn], g[maxn], dp[maxn][maxn], fac[maxn], a[maxn], b[maxn], f_k, t[maxn];
inline void mod(int &x) { if (x >= Mod) x -= Mod; if (x < 0) x += Mod; }
inline void Init()
{
For(i, 1, n) a[i] = read();
For(i, 1, n) b[i] = read();
sort(a + 1, a + 1 + n), sort(b + 1, b + 1 + n);
For(i, 1, n) for (t[i] = t[i - 1]; t[i] < n && b[t[i] + 1] < a[i]; ++ t[i]) ;
For(i, 0, n) {
C[i][0] = C[i][i] = 1;
For(j, 1, i - 1) mod(C[i][j] = C[i - 1][j] + C[i - 1][j - 1]);
}
fac[0] = 1;
For(i, 1, n) fac[i] = (LL)fac[i - 1] * (LL)i % Mod;
}
inline void Solve()
{
//dp[i][j] = dp[i - 1][j] + (n - j + 1) * dp[i - 1][j - 1]
For(i, 0, n) dp[i][0] = 1;
For(i, 1, n) For(j, 1, i) mod(dp[i][j] = dp[i - 1][j] + (LL)max(0, t[i] - j + 1) * (LL)dp[i - 1][j - 1] % Mod);
For(i, 1, n) g[i] = (LL)dp[n][i] * (LL)fac[n - i] % Mod;
For(i, k, n) mod(f_k += (((i - k) & 1) ? -1 : 1) * (LL)C[i][k] * (LL)g[i] % Mod);
printf("%d\n", f_k);
}
int main()
{
File();
n = read(), k = read();
if ((n - k) & 1 || n < k) { puts("0"); return 0; }
k += (n - k) / 2;
Init();
Solve();
return 0;
}