Problem Description
There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe different regions of Atlantis. Your friend Bill has to know the total area for which maps exist. You (unwisely) volunteered to write a program that calculates this quantity.
Input
The input file consists of several test cases. Each test case starts with a line containing a single integer n (1<=n<=100) of available maps. The n following lines describe one map each. Each of these lines contains four numbers x1;y1;x2;y2 (0<=x1<x2<=100000;0<=y1<y2<=100000), not necessarily integers. The values (x1; y1) and (x2;y2) are the coordinates of the top-left resp. bottom-right corner of the mapped area.
The input file is terminated by a line containing a single 0. Don’t process it.
The input file is terminated by a line containing a single 0. Don’t process it.
Output
For each test case, your program should output one section. The first line of each section must be “Test case #k”, where k is the number of the test case (starting with 1). The second one must be “Total explored area: a”, where a is the total explored area (i.e. the area of the union of all rectangles in this test case), printed exact to two digits to the right of the decimal point.
Output a blank line after each test case.
Output a blank line after each test case.
Sample Input
2 10 10 20 20 15 15 25 25.5 0
Sample Output
Test case #1 Total explored area: 180.00
求矩形面积并,线段树加离散化,主要看这个代码是怎么运行的,这里有一个博客写的很详细的,可以进去看看。我的思路全在代码之中。
#include<bits/stdc++.h>
using namespace std;
#define maxn 2000
typedef long long ll;
struct seg
{
double l,r,h;
int f;//左端点,右端点,该线条的高度,上边?下边(-1,1)
seg(){}
seg(double a,double b,double c,int d):l(a),r(b),h(c),f(d){}
bool operator < (const seg&cmp) const{
return h<cmp.h;}
}ss[maxn*+10];
double X[maxn+10];//离散化x轴坐标
int cnt[maxn*4+10];//该节点下的区间是否还有面积未计算(即该区间的下边数-上边数)
double sum[maxn+10];
void pushup(int l,int r,int node)
{
if(cnt[node]!=0)
sum[node]=X[r+1]-X[l];
else if(l==r)
sum[node]=0;
else
sum[node]=sum[node<<1]+sum[node<<1|1];
}
void update(int L,int R,int f,int l,int r,int node)
{
if(L<=l&&r<=R)
{
cnt[node]+=f;
pushup(l,r,node);
return ;
}
int m=(l+r)>>1;
if(L<=m)
update(L,R,f,l,m,node<<1);
if(m<R)
update(L,R,f,m+1,r,node<<1|1);
pushup(l,r,node);
}
int main()
{
int n;
int kase=1;
while(scanf("%d",&n),n)
{
double x,xx,y,yy;
int m=0;
while(n--)
{
scanf("%lf%lf%lf%lf",&x,&y,&xx,&yy);
X[m]=x;
ss[m++]=seg(x,xx,y,1);
X[m]=xx;
ss[m++]=seg(x,xx,yy,-1);
}
sort(X,X+m);
sort(ss,ss+m);
int k=1;
for(int i=1;i<m;i++)
if(X[i]!=X[i-1])
X[k++]=X[i];
memset(cnt,0,sizeof(cnt));
memset(sum,0,sizeof(sum));
double ret =0;
// for(int i=0;i<k;i++)
// printf("%.2lf %.2lf\n",ss[i].l,ss[i].r);
for(int i=0;i<m-1;i++)//m条上下边最多m-1个计算区域
{
int l=lower_bound(X,X+k,ss[i].l)-X;
int r=lower_bound(X,X+k,ss[i].r)-X-1;
// printf("%d %d\n",l,r);
if(l<=r) update(l,r,ss[i].f,0,k-1,1);
ret+=sum[1]*(ss[i+1].h-ss[i].h);
//printf("%d %.2f\n",i,ret);
}
printf("Test case #%d\nTotal explored area: %.2lf\n\n",kase++,ret);
}
return 0;
}