[容斥DP & 高精度] BZOJ2024 [SHOI2009] 舞会

男女生按升高排序
令 $f_{i,j}$ 表示前 $i$ 个女生中有 $j$ 个比男生高（其他 $i-j$ 个不确定）的方案数

DP出来了容斥一下就可以了

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N=210;

const int con=100000000;  
const int wei=8;  
class Int{    
public:long long a[60];    
  void getdata(int x){memset(a,0,sizeof(a));while (x){a[++a[0]]=x%con;x=x/con;}}    
  void print(bool flag){    
    if (a[0]==0||(a[0]==1&&a[1]==0)){printf("0");if (flag)printf("\n");return;}    
    printf("%lld",a[a[0]]);    
    for (int i=a[0]-1;i;i--)    
      printf("%08lld",a[i]);    
    if (flag)printf("\n");    
  }
  Int operator =(const int &X){
    getdata(X); return *this;
  }
  bool operator <(const Int &X){    
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;    
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}    
    return false;    
  }    
  bool operator >(const Int &X){    
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;    
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}    
    return false;    
  }    
  bool operator <=(const Int &X){    
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;    
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}    
    return true;    
  }    
  bool operator >=(const Int &X){    
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;    
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}    
    return true;    
  }    
  bool operator ==(const Int &X){    
    if (a[0]!=X.a[0])return false;for (int i=a[0];i;i--)if (a[i]!=X.a[i])return false;    
    return true;    
  }    
  Int operator +(const Int &X){    
    Int c;memset(c.a,0,sizeof(c.a));    
    for (int i=1;i<=a[0]||i<=X.a[0];i++)    
      {c.a[i]=c.a[i]+a[i]+X.a[i];c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}    
    c.a[0]=max(a[0],X.a[0]);if (c.a[c.a[0]+1])c.a[0]++;    
    return c;    
  }    
  Int operator +(int num){    
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]+=num;    
    for (int i=1;i<=c.a[0]&&c.a[i]>=con;i++)c.a[i]-=con,c.a[i+1]++;    
    while (c.a[c.a[0]+1])c.a[0]++;    
    return c;    
  }    
  Int operator -(const Int &X){    
    Int c;memcpy(c.a,a,sizeof(c.a));    
    for (int i=1;i<=a[0];i++){c.a[i]=c.a[i]-X.a[i];if (c.a[i]<0){c.a[i+1]--;c.a[i]+=con;}}    
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    
    return c;    
  }    
  Int operator -(int num){    
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]-=num;    
    for (int i=1;i<=c.a[0]&&c.a[i]<0;i++)c.a[i]+=con,c.a[i+1]--;    
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    
    return c;    
  }    
  Int operator *(const Int &X){    
    Int c;memset(c.a,0,sizeof(c.a));    
    for (int i=1;i<=a[0];i++)for (int j=1;j<=X.a[0];j++)    
                   {c.a[i+j-1]+=a[i]*X.a[j];c.a[i+j]+=c.a[i+j-1]/con;c.a[i+j-1]%=con;}    
    c.a[0]=max(a[0]+X.a[0]-1,0ll);if (c.a[a[0]+X.a[0]]>0)c.a[0]++;    
    return c;    
  }    
  Int operator *(int num){    
    Int c;memset(c.a,0,sizeof(c.a));    
    for (int i=1;i<=a[0];i++){c.a[i]+=a[i]*num;if (c.a[i]>=con){c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}}    
    c.a[0]=a[0];if (c.a[c.a[0]+1]>0)c.a[0]++;    
    return c;    
  }
  Int operator /(int num){    
    Int c;memset(c.a,0,sizeof(c.a));    
    long long x=0;for (int i=a[0];i;i--){x=x*con+a[i];c.a[i]=x/num;x=x%num;}    
    c.a[0]=a[0];if (c.a[0]&&!c.a[c.a[0]])c.a[0]--;    
    return c;    
  }
  Int operator +=(Int num){ *this=*this+num; return *this; }
  Int operator -=(Int num){ *this=*this-num; return *this; }
  Int operator *=(Int num){ *this=*this*num; return *this; }
};  

int n,k,a[N],b[N];
Int fac[N],C[N][N],f[N][N];

int main(){
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
  scanf("%d%d",&n,&k);
  for(int i=1;i<=n;i++) scanf("%d",&b[i]);
  for(int i=1;i<=n;i++) scanf("%d",&a[i]);
  sort(a+1,a+1+n); sort(b+1,b+1+n);
  f[0][0]=1;
  for(int i=1,p=0;i<=n;i++){
    while(a[i]>b[p+1] && p<n) p++;
    for(int j=0;j<=i;j++){
      f[i][j]=f[i-1][j];
      if(p-(j-1)>0) f[i][j]+=f[i-1][j-1]*(p-(j-1));
    }
  }
  C[0][0]=1;
  for(int i=1;i<=n;i++){
    C[i][0]=1;
    for(int j=1;j<=i;j++)
      C[i][j]=C[i-1][j]+C[i-1][j-1];
  }
  fac[0]=1; for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i;
  for(int i=0;i<=n;i++) f[n][i]*=fac[n-i];
  for(int i=n;~i;i--){
    for(int j=i+1;j<=n;j++)
      f[n][i]-=C[j][i]*f[n][j];
  }
  Int ans; ans=0;
  for(int i=0;i<=k;i++) ans+=f[n][i];
  ans.print(1);
  return 0;
}