HDU-1542（线段树+扫描线）

Atlantis

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8028    Accepted Submission(s): 3509

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.

 

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
  
  
  
  


  
  
  
  

   
   线段树扫描线的题目
  
  
  
  


  
  
  
  

   
   flag标记是下底边（-1）还是下底边（1），不断更新区间线段的长度，1+-1就是0代表此段线段更新后就不存在了，面积就是区间线段长度的最大值乘以扫过的高度，从下向上扫按Y排序，从左向右扫按X排序。
  
  
  
  


  
  
  
  

   
   代码：
  
  
  
  

   
   
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int maxd=10000+5;
const int maxn=10000+5;
#define lz 2*o,l,mid
#define rz 2*o+1,mid+1,r
typedef long long ll;
typedef pair<int,int> pii;
//---------------------------

int cnt,n,cntx;
double sum[maxd],x[maxd];
int flag[maxd];

struct point
{
    double lx,rx,y;
    int flag;
    friend bool operator<(point a,point b)
    {
        return a.y<b.y;
    }
}pp[maxd];

void push_up(int o,int l,int r)
{
    if(flag[o]) sum[o]=x[r+1]-x[l];
    else if(l==r) sum[o]=0;
    else sum[o]=sum[2*o]+sum[2*o+1];
}

void update(int o,int l,int r,int ql,int qr,int v)
{
    if(ql<=l && r<=qr)
    {
        flag[o]+=v;
        push_up(o,l,r);
        return;
    }
    int mid=(l+r)>>1;
    if(qr<=mid) update(lz,ql,qr,v);
    else if(ql>mid) update(rz,ql,qr,v);
    else
    {
        update(lz,ql,mid,v);
        update(rz,mid+1,qr,v);
    }

    push_up(o,l,r);

}

int main()
{
    int kase=1;
    while(scanf("%d",&n)!=EOF && n)
    {
        cnt=1;cntx=2;
        mem(sum,0.0);
        mem(flag,0);
        for(int i=0;i<n;++i)
        {
            double x1,x2,y1,y2;
            scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
            x[cnt]=x1;
            pp[cnt++]={x1,x2,y1,1};
            x[cnt]=x2;
            pp[cnt++]={x1,x2,y2,-1};
        }
        sort(x+1,x+cnt);
        sort(pp+1,pp+cnt);

        for(int i=2;i<cnt;++i)
            if(x[i]!=x[i-1])
              x[cntx++]=x[i];

//         for(int i=1;i<cntx;++i)
//            cout<<x[i]<<' ';
//         cout<<endl;

        double ans=0;
        for(int i=1;i<cnt;++i)
        {
            int l=lower_bound(x+1,x+cntx,pp[i].lx)-x;
            int r=lower_bound(x+1,x+cntx,pp[i].rx)-x-1;
            cout<<l<<' '<<r<<endl;
            update(1,1,cntx-1,l,r,pp[i].flag);
           // cout<<sum[1]<<endl;
            ans+=sum[1]*(pp[i+1].y-pp[i].y);
        }
        printf("Test case #%d\n",kase++);
        printf("Total explored area: %.2lf\n\n",ans);
    }
    return 0;
}