HDU3265 Posters(线段树,扫描线,矩形面积并)
来源:互联网 发布:mac怎么下载lol美服 编辑:程序博客网 时间:2024/05/21 07:12
题目:
Posters
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6347 Accepted Submission(s): 1527
Problem Description
Ted has a new house with a huge window. In this big summer, Ted decides to decorate the window with some posters to prevent the glare outside. All things that Ted can find are rectangle posters.
However, Ted is such a picky guy that in every poster he finds something ugly. So before he pastes a poster on the window, he cuts a rectangular hole on that poster to remove the ugly part. Ted is also a careless guy so that some of the pasted posters may overlap when he pastes them on the window.
Ted wants to know the total area of the window covered by posters. Now it is your job to figure it out.
To make your job easier, we assume that the window is a rectangle located in a rectangular coordinate system. The window’s bottom-left corner is at position (0, 0) and top-right corner is at position (50000, 50000). The edges of the window, the edges of the posters and the edges of the holes on the posters are all parallel with the coordinate axes.
However, Ted is such a picky guy that in every poster he finds something ugly. So before he pastes a poster on the window, he cuts a rectangular hole on that poster to remove the ugly part. Ted is also a careless guy so that some of the pasted posters may overlap when he pastes them on the window.
Ted wants to know the total area of the window covered by posters. Now it is your job to figure it out.
To make your job easier, we assume that the window is a rectangle located in a rectangular coordinate system. The window’s bottom-left corner is at position (0, 0) and top-right corner is at position (50000, 50000). The edges of the window, the edges of the posters and the edges of the holes on the posters are all parallel with the coordinate axes.
Input
The input contains several test cases. For each test case, the first line contains a single integer N (0<N<=50000), representing the total number of posters. Each of the following N lines contains 8 integers x1, y1, x2, y2, x3, y3, x4, y4, showing details about one poster. (x1, y1) is the coordinates of the poster’s bottom-left corner, and (x2, y2) is the coordinates of the poster’s top-right corner. (x3, y3) is the coordinates of the hole’s bottom-left corner, while (x4, y4) is the coordinates of the hole’s top-right corner. It is guaranteed that 0<=xi, yi<=50000(i=1…4) and x1<=x3<x4<=x2, y1<=y3<y4<=y2.
The input ends with a line of single zero.
The input ends with a line of single zero.
Output
For each test case, output a single line with the total area of window covered by posters.
Sample Input
20 0 10 10 1 1 9 92 2 8 8 3 3 7 70
Sample Output
56
Source
2009 Asia Ningbo Regional Contest Hosted by NIT
Recommend
lcy | We have carefully selected several similar problems for you: 3268 3264 3262 3269 3263
题意是有很多矩形,每一个矩形挖去其中的一个小矩形,问最后的总面积是多少。
比如上图,红色的部分是被挖去的,我们只需要计算一下剩下颜色的四个小矩形的面积之和就可以了。
代码:
#include <cstdio>#include <cstring>#include <cctype>#include <string>#include <set>#include <iostream>#include <stack>#include <cmath>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define inf 0x3f3f3f3f#define N 50200#define ll long longusing namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1struct Seg{int l,r,h;int f;Seg() {}Seg(int a,int b,int c,int d):l(a),r(b),h(c),f(d) {}bool operator < (const Seg &cmp) const{return h<cmp.h;}} e[N<<3];struct node{int cnt;ll len;} t[N<<2];int X[N<<3];void pushdown(int l,int r,int rt){if(t[rt].cnt)t[rt].len=X[r+1]-X[l];else if(l==r)t[rt].len=0;elset[rt].len=t[rt<<1].len+t[rt<<1|1].len;}void update(int L,int R,int l,int r,int rt,int val){if(L>R) return;//重要,要排除这种情况if(L<=l&&r<=R){t[rt].cnt+=val;pushdown(l,r,rt);return;}int m=(l+r)>>1;if(L<=m) update(L,R,lson,val);if(R>m) update(L,R,rson,val);pushdown(l,r,rt);}int main(){int n,q;int a1,b1,c1,d1,a2,b2,c2,d2;while(~scanf("%d",&n)&&n){mem(t,0);int num=0;for(int i=0; i<n; i++){scanf("%d%d%d%d%d%d%d%d",&a1,&b1,&c1,&d1,&a2,&b2,&c2,&d2);X[num]=a1;e[num++]=Seg(a1,c1,b1,1);X[num]=c1;e[num++]=Seg(a1,c1,b2,-1);X[num]=a1;e[num++]=Seg(a1,c1,d2,1);X[num]=c1;e[num++]=Seg(a1,c1,d1,-1);X[num]=a1;e[num++]=Seg(a1,a2,b2,1);X[num]=a2;e[num++]=Seg(a1,a2,d2,-1);X[num]=c2;e[num++]=Seg(c2,c1,b2,1);X[num]=c1;e[num++]=Seg(c2,c1,d2,-1);}sort(X,X+num);sort(e,e+num);int m=unique(X,X+num)-X;ll ans=0;for(int i=0; i<num; i++){int l=lower_bound(X,X+m,e[i].l)-X;int r=lower_bound(X,X+m,e[i].r)-X-1;update(l,r,0,m,1,e[i].f);ans+=(ll)t[1].len*(e[i+1].h-e[i].h);}printf("%lld\n",ans);}return 0;}
阅读全文
0 0
- HDU3265 Posters(线段树,扫描线,矩形面积并)
- HDU3265(线段树+扫描线+挖空矩形面积并)
- hdu3265-Posters 线段树+离散化 求矩形面积并
- HDU3265 Posters(线段树+扫描线——面积交)
- 扫描线 求挖空矩形合并面积 hdu3265 Posters
- hdu3265(线段树求矩形面积并)
- hdu 3265 Posters(矩形面积并 扫描线+线段树)
- HDU 3265 Posters(线段树扫描线·矩形框面积并)
- hdu3265 Posters--扫描线 & 线段树(待解决)
- 线段树面积并hdu3265
- hdu3265 矩形面积并
- FAFU-1398 面积 矩形面积并 线段树+扫描线
- 线段树 hdu3265 Posters
- 矩形面积并、矩形面积交、矩形周长并(线段树、扫描线总结)
- 矩形面积并、矩形面积交、矩形周长并(线段树、扫描线总结)
- HDU3265 线段树 线扫描
- HDU1542 Atlantis(扫描线+矩形面积并+线段树)
- POJ1151(线段树+扫描线求矩形面积并)
- js jsonp
- 腾讯优图NCNN框架在windows下的vs2013配置
- File路径相关_关于文件路径的反斜杠正斜杠和双斜杠问题
- Python小游戏 -- 猜数字
- Unity3d 技巧(14) -自定义 UnityEvent 序列化到Editor 界面
- HDU3265 Posters(线段树,扫描线,矩形面积并)
- Spring实战笔记——面向切面编程(一)
- tomcat安装前为什么要安装jdk?
- c++对象内存布局
- 【JZOJ 5239】 【GDOI2018模拟8.7】图的异或
- 算法:动态规划之金矿问题(时间复杂度O(n*w))
- 预处理命令
- CNN卷积神经网络内存占用计算
- 程序员面试系列——合并排序(递归实现)