USACO RECT1 离散化处理

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/cnyali/article/details/77159701

#include<iostream>
#include<cstdio>
#include<cstring>
const int maxn=2002,maxm=10000+1;
using namespace std;
struct node{int x1,y1,x2,y2,c;}s[1001];
short int a[maxn][maxn];
int sjx[maxm],sjy[maxm],xnx[maxn],xny[maxn],cs[1000+5];
bool p[maxm]; 
int main(){
	freopen("rect1.in","r",stdin);
	freopen("rect1.out","w",stdout);
	int i,j,k,m,n;
	cin>>m>>n>>k;
	for(i=1;i<=k;i++){
		int x1,y1,x2,y2,c;
		scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&c);
		s[i].x1=x1;s[i].x2=x2;s[i].y1=y1;s[i].y2=y2;s[i].c=c;		
	}
	memset(p,0,sizeof(p));//p代表添加的关键点 
	p[0]=p[m]=1;
	for(i=1;i<=k;i++)p[s[i].x1]=p[s[i].x2]=1;
	int xn=-1;
	for(i=0;i<=m;i++) 
		if(p[i]){
			xnx[++xn]=i;
			sjx[i]=xn;
		}
	memset(p,0,sizeof(p));
	p[0]=p[n]=1;
	for(i=1;i<=k;i++)p[s[i].y1]=p[s[i].y2]=1;
	int yn=-1;
	for(i=0;i<=n;i++)
		if(p[i]){
			xny[++yn]=i;
			sjy[i]=yn;
		}
	for(i=1;i<=xn;i++)
		for(j=1;j<=yn;j++)
			a[i][j]=1;
	//(xnx & sjx) || (xny &&  sjy) == 对应关系 
	for(i=1;i<=k;i++){	
		for(int u=sjx[s[i].x1]+1;u<=sjx[s[i].x2];u++)
			for(int v=sjy[s[i].y1]+1;v<=sjy[s[i].y2];v++)
				a[u][v]=s[i].c;
	}
	for(i=1;i<=xn;i++)
		for(j=1;j<=yn;j++)
			cs[a[i][j]]+=(xnx[i]-xnx[i-1])*(xny[j]-xny[j-1]);
	for(i=1;i<=1000;i++)
		if(cs[i])printf("%d %d\n",i,cs[i]);
	return 0;
}