HDU 1542 Atlantis(线段树+扫描线求面积并)

题目链接

题意：给出n个矩形的左下坐标和右上坐标(矩形有重叠)求面积。

题解：这是一道用扫描线求面积并的题目。学习见：扫描线法求矩形面积并和扫描线专辑

#include<bits/stdc++.h>
using namespace std;
const int maxn=107;
double y[maxn*2];
struct LINE
{
    double x,y_down,y_up;
    int flag;
}line[maxn<<1];
bool cmp(const LINE& a,const LINE& b)
{
    return a.x<b.x;
}
struct TREE
{
    double x,y_down,y_up;
    int cover;
    bool flag;
}tree[maxn<<4];
void build(int l,int r,int rt)
{
    tree[rt].cover=0;
    tree[rt].flag=0;
    tree[rt].x=-1;
    tree[rt].y_down=y[l];
    tree[rt].y_up=y[r];
    if(l+1==r)
    {
        tree[rt].flag=1;
        return;
    }
    int m=(l+r)>>1;
    build(l,m,rt<<1);
    build(m,r,rt<<1|1);
}
double query(double x,double l,double r,int rt,int flag)
{
    if(r<=tree[rt].y_down||l>=tree[rt].y_up)
        return 0;
    if(tree[rt].flag)
    {
        if(tree[rt].cover>0)
        {
            double ans=(x-tree[rt].x)*(tree[rt].y_up-tree[rt].y_down);
            tree[rt].cover+=flag;
            tree[rt].x=x;
            return ans;
        }
        else
        {
            tree[rt].cover+=flag;
            tree[rt].x=x;
            return 0;
        }
    }
    return query(x,l,r,rt<<1,flag)+query(x,l,r,rt<<1|1,flag);
}
int main()
{
    int n,cas=0;
    while(~scanf("%d",&n),n)
    {
        int i,j,t=0;
        for(i=1;i<=n;i++)
        {
            double x1,y1,x2,y2;
            scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
            t++;
            y[t]=y1;
            line[t].x=x1;
            line[t].y_down=y1;
            line[t].y_up=y2;
            line[t].flag=1;
            t++;
            y[t]=y2;
            line[t].x=x2;
            line[t].y_down=y1;
            line[t].y_up=y2;
            line[t].flag=-1;
        }
        sort(y+1,y+t+1);
        sort(line+1,line+t+1,cmp);
        build(1,t,1);
        double ans=0;
        for(i=1;i<=t;i++)
        {
            ans+=query(line[i].x,line[i].y_down,line[i].y_up,1,line[i].flag);
        }
        printf("Test case #%d\n",++cas);
        printf("Total explored area: %.2lf\n\n",ans);
    }
    return 0;
}