hdu 2461

我的容斥跑的好慢。。不知道为什么。。

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)			memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 1<<20;
const int maxz = 100011;

struct zz
{
	int x,y;
	int _x,_y;
	int c;
}zx[21];
int n,m;
int s[maxn];
int a[maxz];
bool vis[maxn];

zz cross(zz a,zz b)
{
	zz re;		
	re.x = max(a.x,b.x);
	re.y = max(a.y,b.y);
	re._x = min(a._x,b._x);
	re._y = min(a._y,b._y);	
	if(re._x<=re.x || re._y<=re.y)
	{
		re.c=0;
	}	
	else
	{
		re.c = (re._x-re.x)*(re._y-re.y);
	}
	return re;
}

int dfs(int sta,zz now,int id=0)
{
	int re=0;
	zz temp;
	for(int i=id;i<n;i++)
	{
		if(sta & (1<<i))
		{	
			temp = cross(now,zx[i]);
			if(temp.c)
			{
				re+=temp.c;
				re-=dfs(sta,temp,i+1);
			}
		}		
	}	
	return re;
}


int main()
{
	int cas=0;
	while(cin>>n>>m)
	{
		if(!m && !n) return 0;
		for(int i=0;i<n;i++)
		{	
			SS(zx[i].x);
			SS(zx[i].y);
			SS(zx[i]._x);
			SS(zx[i]._y);	
			zx[i].c = (zx[i]._x-zx[i].x)*(zx[i]._y-zx[i].y);
		}
		for(int i=0;i<(1<<n);i++)
		{	
			vis[i]=false;
		}
		for(int i=1;i<=m;i++)
		{
			a[i]=0;
		}
		int r;
		int temp;
		for(int i=1;i<=m;i++)
		{	
			SS(r);
			for(int x=1;x<=r;x++)
			{
				SS(temp);
				temp--;
				a[i] |= (1<<temp);
			}				
		}
		printf("Case %d:\n",++cas);
		zz tmp;
		for(int i=1;i<=m;i++)
		{
			printf("Query %d: ",i);
			if(!vis[a[i]])			
			{
				vis[a[i]]=true;								
				tmp.x=tmp.y=0;
				tmp._x=tmp._y=1010;	
				s[a[i]]=dfs(a[i],tmp);
			}
			printf("%d\n",s[a[i]]);
		}		
		printf("\n");
	}
	return 0;
}

写了个稍微快了一点的，390ms

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)			memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 1<<20;
const int maxz = 100011;

struct zz
{
	int x,y;
	int _x,_y;
	int c;
}zx[21];
int n,m;
int s[maxn];
int a[maxz];
bool vis[maxn];
vector<int>v;

zz cross(zz a,zz b)
{
	zz re;		
	re.x = max(a.x,b.x);
	re.y = max(a.y,b.y);
	re._x = min(a._x,b._x);
	re._y = min(a._y,b._y);	
	if(re._x<=re.x || re._y<=re.y)
	{
		re.c=0;
	}	
	else
	{
		re.c = (re._x-re.x)*(re._y-re.y);
	}
	return re;
}

void dfs(zz now,int sta=0,int add=-1,int step=0)
{
	if(step == n)
	{
		for(int i=0;i<v.size();i++)
		{
			if((sta | v[i]) == v[i])
			{
				s[v[i]]+=add*now.c;	
			}
		}	
	}	
	else	
	{	
		zz temp;
		temp = cross(now,zx[step]);
		dfs(now,sta,add,step+1);		
		if(temp.c) 
		{
			dfs(temp,sta|(1<<step),-add,step+1);
		}
	}
}


int main()
{
	int cas=0;
	while(cin>>n>>m)
	{
		if(!m && !n) return 0;
		for(int i=0;i<n;i++)
		{	
			SS(zx[i].x);
			SS(zx[i].y);
			SS(zx[i]._x);
			SS(zx[i]._y);	
			zx[i].c = (zx[i]._x-zx[i].x)*(zx[i]._y-zx[i].y);
		}
		for(int i=1;i<=m;i++)
		{
			a[i]=0;
		}
		int r;
		int temp;
		for(int i=1;i<=m;i++)
		{	
			SS(r);
			for(int x=1;x<=r;x++)
			{
				SS(temp);
				temp--;
				a[i] |= (1<<temp);
			}				
		}
		for(int i=1;i<=m;i++)
		{
			vis[a[i]]=false;
		}
		v.clear();
		for(int i=1;i<=m;i++)
		{	
			if(!vis[a[i]])
			{
				vis[a[i]]=true;
				s[a[i]]=0;
				v.pb(a[i]);
			}
		}	
		zz tmp;
		tmp.x=tmp.y=0;
		tmp._x=tmp._y=1010;
		tmp.c=0;
		dfs(tmp);
		printf("Case %d:\n",++cas);
		for(int i=1;i<=m;i++)
		{
			printf("Query %d: %d\n",i,s[a[i]]);			
		}
		printf("\n");
	}
	return 0;
}