HDU1828 求周长并 线段树+离散化

Picture

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 415    Accepted Submission(s): 237

Problem Description

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.

Please process to the end of file.

 

 

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

 

 

离散化 + 线段树 .

读入数据时记录竖着的边的两端坐标 x,y1,y2 和 Y 轴上出现过的坐标 tempy[], 对 tempy 从小到大排序 , 去掉重复的 y 轴坐标转存到数组 y[], 利用 y[] 的数据对 Y 轴进行离散化建立线段树 , 然后对竖着的边排序 , 从左到右扫描 , 根据扫描到的竖边的 y 轴覆盖区间对线段树进行维护更新 , 统计覆盖的总长度 , 每更新一次都记录一下 y 轴被覆盖的总长度 , 每次更新之后 y 轴覆盖的总长度的变化量就是轮廓的周长增加的长度 . 同时加上 x 轴上增加的长度 ( 如果 y 轴有被覆盖的话 , 这个用线段树的根节点可以判断 ), 直到扫描结束 .

 

代码如下 :

 

#include<stdio.h> #include<string.h> #include<algorithm> using std::sort; #define MAXN 5005 struct ST { int lc,rc; int l,r; //左右端点,对应数组y[]的下标 int cov,covn; //cov是否被完全覆盖,covn判断覆盖次数 int covlen; //覆盖长度 } st[3*MAXN]; struct Line { int x,y1,y2,flag; bool operator < (Line const &a) const { if (x<a.x) return 1; else if (x==a.x) return flag>a.flag; return 0; } } line[3*MAXN]; int y[MAXN]; void build(int l,int r,int n) { st[n].l=y[l]; st[n].r=y[r]; st[n].cov=st[n].covlen=st[n].covn=st[n].lc=st[n].rc=0; st[2*n].cov=st[2*n].covlen=st[2*n].covn=st[2*n].lc=st[2*n].rc=0; st[2*n+1].cov=st[2*n+1].covlen=st[2*n+1].covn=st[2*n+1].lc=st[2*n+1].rc=0; if (r-l==1) return ; int mid=(l+r)/2; build(l,mid,2*n); build(mid,r,2*n+1); } void update(int n,Line line) { if (st[n].l==line.y1) st[n].lc+=line.flag; if (st[n].r==line.y2) st[n].rc+=line.flag; if (st[n].l==line.y1&&st[n].r==line.y2) st[n].cov+=line.flag; else { if (line.y2<=st[2*n].r) update(2*n,line); else if (line.y1>=st[2*n+1].l) update(2*n+1,line); else { Line l1=line,l2=line; l1.y2=st[n*2].r; l2.y1=st[2*n+1].l; update(2*n,l1); update(2*n+1,l2); } } if (st[n].cov==1) { st[n].covlen=st[n].r-st[n].l; } else { st[n].covlen=st[2*n].covlen+st[2*n+1].covlen; } st[n].covn+=line.flag; } int main() { int n,i,xs,x1,y1,x2,y2,t,tempy[MAXN]; while (scanf("%d",&n)!=EOF) { xs=1; for (i=1; i<=n; ++i) { scanf("%d%d%d%d",&x1,&y1,&x2,&y2); line[xs].x=x1; line[xs].y1=y1; line[xs].y2=y2; line[xs].flag=1; line[xs+1].x=x2; line[xs+1].y1=y1;; line[xs+1].y2=y2; line[xs+1].flag=-1; tempy[xs]=y1; tempy[xs+1]=y2; xs+=2; } xs-=2; sort(line+1,line+xs+1); sort(tempy+1,tempy+xs+1); t=0; y[++t]=tempy[1]; y[0]=-2100000000; for (i=2; i<=xs+1; ++i) { if (tempy[i]!=y[t]) y[++t]=tempy[i]; //除去相同的y轴坐标 else continue; } build(1,t,1); int lastlen=0,res=0;; for (i=1; i<=xs+1; ++i) { if (st[1].covn) res+=(line[i].x-line[i-1].x)*2; //更新X轴增加的长度 update(1,line[i]); //更新线段树 res+=abs(lastlen-st[1].covlen); //更新y轴增加的长度 lastlen=st[1].covlen; } printf("%d/n",res); } return 0; }