HDU - 1542 Atlantis 和 POJ - 1177 Picture

HDU1542
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.
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.
Sample Input
2
10 10 20 20
15 15 25 25.5
0
Sample Output
Test case #1
Total explored area: 180.00
扫描线求面积。

#include<iostream>
#include<algorithm>
using namespace std;
double x1,x2,y1,y2,b[50000];
struct mmp
{
    int l, r, s;
    double sum;
}tree[50000];
struct cnm
{
    double l,r,h;
    int f;
}a[50000];
void build(int k,int l,int r)
{
    tree[k].l=l;
    tree[k].r=r;
    tree[k].s=0;
    tree[k].sum=0;
    if(l==r) return ;
    int mid=(l+r)>>1;
    build(2*k,l,mid);
    build(2*k+1,mid+1,r);
}
void pushup(int k)
{
    if(tree[k].s) tree[k].sum=b[tree[k].r]-b[tree[k].l-1];
    else if(tree[k].l==tree[k].r) tree[k].sum=0;
    else tree[k].sum=tree[2*k].sum+tree[2*k+1].sum;
}
void update(int k,int l,int r,int f)
{
    if(tree[k].l>=l&&tree[k].r<=r) {
        tree[k].s+=f;
        pushup(k);
        return ;
    }
    int mid=(tree[k].l+tree[k].r)>>1;
    if(l<=mid) update(2*k,l,r,f);
    if(r>mid) update(2*k+1,l,r,f);
    pushup(k);
}
int search(double key,int l,int r)
{
    int mid=(l+r)>>1;
    if(b[mid]==key) return mid;
    if(b[mid]<key) return search(key,mid+1,r);
    else return search(key,l,mid-1);
}
bool cmp(cnm aa,cnm bb)
{
    return aa.h<bb.h;
}
int main()
{    int N,k=1,m;
    while(cin>>N&&N) {
        m=0;
        for(int i=0;i<N;i++) {
            cin>>x1>>y1>>x2>>y2;
            a[m].l=x1,a[m].r=x2,a[m].f=1,a[m].h=y1,b[m++]=x1;
            a[m].l=x1,a[m].r=x2,a[m].f=-1,a[m].h=y2,b[m++]=x2;
        }
        sort(b,b+m);
        sort(a,a+m,cmp);
        int n=0;
        for(int i=1;i<m;i++) {
            if(b[i]!=b[n]) b[++n]=b[i];
        }
        build(1,1,n+1);
        double ans=0;
        for(int i=0;i<m;i++){
            int L=search(a[i].l,0,n)+1;
            int R=search(a[i].r,0,n);
            update(1,L,R,a[i].f);
            ans+=tree[1].sum*(a[i+1].h-a[i].h);
        }
        printf("Test case #%d\nTotal explored area: %.2lf\n\n",k++,ans);
    }
return 0;
}

POJ1177
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially or totally covered by the others. The length of the boundary of the union of all rectangles is called the perimeter.

Write a program to calculate the perimeter. An example with 7 rectangles is shown in Figure 1.

The corresponding boundary is the whole set of line segments drawn in Figure 2.

The vertices of all rectangles have integer coordinates.
Input
Your program is to read from standard input. The first line contains the number of rectangles pasted on the wall. In each of the subsequent lines, one can find the integer coordinates of the lower left vertex and the upper right vertex of each rectangle. The values of those coordinates are given as ordered pairs consisting of an x-coordinate followed by a y-coordinate.

0 <= number of rectangles < 5000
All coordinates are in the range [-10000,10000] and any existing rectangle has a positive area.
Output
Your program is to write to standard output. The output must contain a single line with a non-negative integer which corresponds to the perimeter for the input rectangles.
Sample Input
7
-15 0 5 10
-5 8 20 25
15 -4 24 14
0 -6 16 4
2 15 10 22
30 10 36 20
34 0 40 16
Sample Output
228
扫描线求周长。（输出sb的是当时为了找出错误）

#include<iostream>
#include<algorithm>
using namespace std;
double x1,x2,y1,y2,b[50000];
struct mmp
{
	double l,r,h;
	int f;
}a[50000];
struct cnm
{
	int l,r,num,s;
	double sum;
	int lc,rc;
}tree[50000];
void build(int k,int l,int r)
{
    tree[k].l=l;
    tree[k].r=r;
    tree[k].s=0;
    tree[k].sum=0;
    tree[k].num=0;
    tree[k].lc=tree[k].rc=0;
    if(l==r) return ;
    int mid=(l+r)/2;
    build(2*k,l,mid);
    build(2*k+1,mid+1,r);
}
void pushup(int k)
{
	if(tree[k].s) {
		tree[k].sum=b[tree[k].r]-b[tree[k].l-1];
		tree[k].lc=tree[k].rc=1;
		tree[k].num=1;
	}
	else if(tree[k].l==tree[k].r) {
		tree[k].sum=0;
		tree[k].lc=tree[k].rc=0;
		tree[k].num=0;
	}
	else {
		tree[k].sum=tree[2*k].sum+tree[2*k+1].sum;
		tree[k].lc=tree[2*k].lc;
		tree[k].rc=tree[2*k+1].rc;
		tree[k].num=tree[2*k].num+tree[2*k+1].num-(tree[2*k].rc&tree[2*k+1].lc);
	}
//	cout<<"pushup"<<endl;
}
void update(int k,int l,int r,int f)
{
	if(tree[k].l>=l&&tree[k].r<=r) {
		tree[k].s += f;
//		cout<<"sb"<<endl;
		pushup(k);
		return ;
	}
	int mid=(tree[k].l+tree[k].r)/2;
//	cout<<"mid"<<endl;
	if(l<=mid) update(2*k,l,r,f);
//	cout<<"left"<<endl;
	if(r>mid) update(2*k+1,l,r,f);
//	cout<<"right"<<endl;
	pushup(k);
}
int search(double key,int l,int r)
{
    int mid=(l+r)/2;
    if(b[mid]==key) return mid;
    if(b[mid]>key) return search(key,l,mid-1);
    else return search(key,mid+1,r);
}
bool cmp(mmp aa,mmp bb)
{
	return aa.h<bb.h;
}
int fabs(double x)
{
	if(x<0) return -x;
	else return x;
}
int main()
{	int N;
	while(cin>>N&&N) {
		int m=0;
		for(int i=1;i<=N;i++) {
		cin>>x1>>y1>>x2>>y2;
		a[m].f=1;a[m].l=x1;a[m].r=x2;a[m].h=y1;b[m++]=x1;
		a[m].f=-1;a[m].l=x1;a[m].r=x2;a[m].h=y2;b[m++]=x2;
		}
		sort(b,b+m);
		sort(a,a+m,cmp);
		int n=0;
		for(int i=1;i<m;i++) 
		if(b[i]!=b[n]) b[++n]=b[i];
		build(1,1,n+1);
//		cout<<"sb"<<endl;
		double ans=0,last=0;
		for(int i=0;i<m;i++)
		{	
//			cout<<"sb"<<endl;
			int L=search(a[i].l,0,n)+1;
			int R=search(a[i].r,0,n);	
//			cout<<L<<" "<<R<<endl;
			update(1,L,R,a[i].f);
//			cout<<"sb"<<endl;
//			cout<<tree[1].sum<<endl;
//			cout<<tree[1].num<<endl;
			ans+=fabs(tree[1].sum-last);
//			cout<<ans<<endl;
			ans+=((a[i+1].h-a[i].h)*2*(tree[1].num));
//			cout<<ans<<endl;
			last=tree[1].sum;
//			cout<<"sb"<<endl;
		}	
		printf("%.0lf\n", ans);
	}
return 0;
}