POJ1151Atlantis【离散化+扫描线+线段树】
来源:互联网 发布:timbuk2什么档次知乎 编辑:程序博客网 时间:2024/05/15 14:22
Language:
Atlantis
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19315 Accepted: 7335
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 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
210 10 20 2015 15 25 25.50
Sample Output
Test case #1Total explored area: 180.00
题意:给出几个矩形求出它们组成的面积;第一道扫描线和离散化看了一下午不过总算是懂了
参考博客:http://www.cnblogs.com/fenshen371/p/3214092.html
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#define lson l,mid,rt<<1#define rson mid,r,rt<<1|1#define MAX 105using namespace std;struct Node{int flag;double l,r,h;}A[MAX<<2];int cover[MAX<<4];double num[MAX<<2],tmp[MAX<<2],len[MAX<<4];void init(){memset(len,0,sizeof(len));memset(cover,0,sizeof(cover));}bool cmp(Node a,Node b){if(a.h==b.h)return a.flag<b.flag;return a.h<b.h;}void pushup(int l,int r,int rt){if(cover[rt])len[rt]=num[r]-num[l];else if(l+1==r)len[rt]=0;else len[rt]=len[rt<<1]+len[rt<<1|1];}void update(int a,int b,int c,int l,int r,int rt){if(a==l&&b==r){cover[rt]+=c;pushup(l,r,rt);return ;}int mid=(l+r)>>1;if(mid>=b)update(a,b,c,lson);else if(mid<=a)update(a,b,c,rson);else {update(a,mid,c,lson);update(mid,b,c,rson);}pushup(l,r,rt);}int search(double now,int n){int left=1,right=n,ans;while(left<=right){int mid=(left+right)>>1;if(num[mid]>=now){ans=mid;right=mid-1;}else {left=mid+1;}}return ans;}int main(){int n,i,j,k,id,t=1;double x1,y1,x2,y2,ans;while(scanf("%d",&n),n){for(id=0,i=0;i<n;++i){scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);A[++id].l=x1;A[id].r=x2;A[id].h=y1;A[id].flag=1;tmp[id]=x1;A[++id].l=x1;A[id].r=x2;A[id].h=y2;A[id].flag=-1;tmp[id]=x2;}sort(A+1,A+id+1,cmp);sort(tmp+1,tmp+id+1);for(id=0,i=1;i<=(n<<1);++i){if(i==1||tmp[i]!=tmp[i-1])num[++id]=tmp[i];}init();ans=0;A[0].h=A[1].h;for(i=1;i<=(n<<1);++i){ans+=len[1]*(A[i].h-A[i-1].h);int l=search(A[i].l,id);int r=search(A[i].r,id);update(l,r,A[i].flag,1,id,1);}printf("Test case #%d\n",t++);printf("Total explored area: %.2lf\n\n",ans);}return 0;}
0 0
- POJ1151Atlantis【离散化+扫描线+线段树】
- POJ1151Atlantis矩形面积并,线段树离散化
- [离散化+线段树+扫描线]POJ_1151_Atlantis
- [离散化+线段树+扫描线]POJ_2091_Picture
- [离散化+线段树+扫描线]POJ_3832_Posters
- Atlantis(扫描线+线段树+离散化)
- hdu1255 线段树+扫描线+离散化
- hdu1542 线段树+扫描线+离散化
- POJ_1151 扫描线+离散化+线段树
- HDU1542 线段树+离散化+扫描线
- HDU1542Atlantis(线段树+离散化+扫描线)
- 离散化-线段树-扫描线小结
- poj 1177 Picture 线段树+离散化+线扫描
- pku 1151 Atlantis(线段树+离散化+扫描线)
- pku 1177 pictures (线段树+扫描线+离散化)
- poj3277(线段树+离散化+扫描线+测度)
- [离散化+扫描线+线段树]LightOJ 1120 - Rectangle Union
- POJ 1151 Atlantis 离散化 + 扫描线 + 线段树
- XHTML表单(二)
- 【Linux】Linux添加系统调用以及内核编译过程
- 设计模式之简单的工厂模式
- python 错误和异常解析
- POJ-1984 Navigation Nightmare
- POJ1151Atlantis【离散化+扫描线+线段树】
- 堆排序的Java实现
- 35选7
- 学习算法的一个博客
- extern 和 static 对变量的作用
- DRBD概念详解及配置
- 对UIView的总结
- getline()函数详解
- UVALive 6659 Dromicpalin Substrings