[DP 容斥原理] BZOJ3622 已经没有什么好害怕的了 && BZOJ 2024 [SHOI2009] 舞会

传送门：http://www.cnblogs.com/dyllalala/p/3900077.html

比较好的DP题

3622

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define P 1000000009
using namespace std;
typedef long long ll;

inline char nc(){
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); return EOF; }
	return *p1++;
}

inline void read(ll &x){
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if(c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

ll n,K,s;
ll a[2005],b[2005];
ll f[2005][2005];
ll fac[2005],C[2005][2005];
ll next[2005];

inline void Pre(){
	fac[0]=1;
	for (int i=1;i<=2000;i++)
		(fac[i]=fac[i-1]*i)%=P;
	C[0][0]=1;
	for (int i=0;i<=2000;i++)
	{
		C[i][0]=1; 
		for (int j=1;j<=i;j++)
			(C[i][j]=C[i-1][j-1]+C[i-1][j])%=P;
	}
}

int main()
{
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	Pre();
	read(n); read(K);
	if ((n+K)&1) return printf("0\n"),0;
	s=(n+K)/2;
	for (int i=1;i<=n;i++) read(a[i]);
	for (int i=1;i<=n;i++) read(b[i]);
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	int j=0;
	for (int i=1;i<=n;i++)
	{
		while (j+1<=n && b[j+1]<a[i]) j++;
		next[i]=j;
	}
	f[0][0]=1;
	for (int i=1;i<=n;i++)
		for (int j=0;j<=i;j++)
		{
			f[i][j]=f[i-1][j];
			if (j && next[i]-j+1>0)
				(f[i][j]+=f[i-1][j-1]*(next[i]-j+1))%=P;
		}
	for (int i=n;i>=s;i--)
	{
		(f[n][i]*=fac[n-i])%=P;
		for (int j=i+1;j<=n;j++)
			(((f[n][i]-=f[n][j]*C[j][i])%=P)+=P)%=P;
	}
	printf("%lld\n",f[n][s]);
	return 0;
}

2024

#include<cstdlib>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
using namespace std;   
typedef long long ll;
  
inline char nc(){  
	static char buf[100000],*p1=buf,*p2=buf;  
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); return EOF; }  
	return *p1++;  
}  
  
inline void read(ll &x){  
	char c=nc(),b=1;  
	for (;!(c>='0' && c<='9');c=nc()) if(c=='-') b=-1;  
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;  
}  

const int con=100000000;
class gj
{
	public:long long a[80];
	void getdata(int x){memset(a,0,sizeof(a));while (x){a[++a[0]]=x%con;x=x/con;}}
	void pri(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");
	}
	bool operator <(const gj &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 gj &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 gj &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 gj &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 gj &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;
	}
	gj operator +(const gj &X){
		gj 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;
	}
	gj operator +(int num){
		gj 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;
	}
	gj operator -(const gj &X){
		gj 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;
	}
	gj operator -(int num){
		gj 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;
	}
	gj operator *(const gj &X){
		gj 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;
	}
	gj operator *(int num){
		gj 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;
	}
	gj operator /(int num){
		gj 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;
	}
};
  
ll n,K,s;gj ans;  
ll a[205],b[205];  
gj f[205][205];  
gj fac[205],C[205][205];  
ll next[205];  
  
inline void Pre(){  
	fac[0].getdata(1);  
	for (int i=1;i<=200;i++)  
		fac[i]=fac[i-1]*i;  
	C[0][0].getdata(1);  
	for (int i=0;i<=200;i++)  
	{  
		C[i][0].getdata(1);   
		for (int j=1;j<=i;j++)  
			C[i][j]=C[i-1][j-1]+C[i-1][j];  
	}  
}  
  
int main()  
{  
	freopen("t.in","r",stdin);  
	freopen("t.out","w",stdout);  
	Pre();  
	read(n); read(K);  
	for (int i=1;i<=n;i++) read(a[i]);  
	for (int i=1;i<=n;i++) read(b[i]);  
	sort(a+1,a+n+1);  
	sort(b+1,b+n+1);  
	int j=0;  
	for (int i=1;i<=n;i++)  
	{  
		while (j+1<=n && b[j+1]<=a[i]) j++;  
		next[i]=j;  
	}  
	f[0][0].getdata(1);  
	for (int i=1;i<=n;i++)  
		for (int j=0;j<=i;j++)  
		{  
			f[i][j]=f[i-1][j];  
			if (j && next[i]-j+1>0)  
				f[i][j]=f[i][j]+f[i-1][j-1]*(next[i]-j+1);  
		}  
	for (int i=n;i>=n-K;i--)  
	{  
		f[n][i]=f[n][i]*fac[n-i];  
		for (int j=i+1;j<=n;j++)  
			f[n][i]=f[n][i]-f[n][j]*C[j][i];  
		ans=ans+f[n][i];
	}  
   	ans.pri(1); 
	return 0;  
}