There are nnn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For example, given a rectangle AAA with the bottom left corner located at (0,0)(0, 0)(0,0) and the top right corner at (2,2)(2, 2)(2,2), and the other rectangle BBB with the bottom left corner located at (1,1)(1,1)(1,1) and the top right corner at (3,3)(3,3)(3,3), it follows that the area of the union of AAA and BBB should be 777, instead of 888.
Although the problem looks simple at the first glance, it might take a while to figure out how to do it correctly. Note that the shape of the union can be very complicated, and the intersected areas can be overlapped by more than two rectangles.
Note:
(1) The coordinates of these rectangles are given in integers. So you do not have to worry about the floating point round-off errors. However, these integers can be as large as 1,000,0001,000,0001,000,000.
(2) To make the problem easier, you do not have to worry about the sum of the areas exceeding the long integer precision. That is, you can assume that the total area does not result in integer overflow.
Input Format
Several sets of rectangles configurations. The inputs are a list of integers. Within each set, the first integer (in a single line) represents the number of rectangles, n, which can be as large as 100010001000. After n, there will be n lines representing the n rectangles; each line contains four integers <a,b,c,d><a, b, c, d><a,b,c,d> , which means that the bottom left corner of the rectangle is located at (a,b)(a, b)(a,b), and the top right corner of the rectangle is located at (c,d)(c, d)(c,d). Note that integers aaa, bbb, ccc, ddd can be as large as 1,000,0001,000,0001,000,000.
These configurations of rectangles occur repetitively in the input as the pattern described above. An integer n=0n = 0n=0 (zero) signifies the end of input.
Output Format
For each set of the rectangles configurations appeared in the input, calculate the total area of the union of the rectangles. Again, these rectangles might overlap each other, and the intersecting areas of these rectangles can only be counted once. Output a single star '*' to signify the end of outputs.
样例输入
2 0 0 2 2 1 1 3 3 3 0 0 1 1 2 2 3 3 4 4 5 5 0
样例输出
7 3 *
直接套模板
参考博客：POJ 1151 Atlantis(重叠矩阵面积和=离散化)
1 #include<cstdio> 2 #include<algorithm> 3 #include<cstring> 4 using namespace std; 5 const int maxn=5555; 6 struct Node//矩形 7 { 8 double x1,y1,x2,y2; 9 }nodes[maxn]; 10 double x[maxn],y[maxn]; 11 bool mp[maxn][maxn]; 12 13 int find(double *x,double val,int n)//在数组x中找到val值的位置 14 { 15 int L=0,R=n-1; 16 while(R>=L) 17 { 18 int mid=L+(R-L)/2; 19 if(x[mid]==val) return mid; 20 else if(x[mid]>val) R=mid-1; 21 else L=mid+1; 22 } 23 return -1; 24 } 25 26 int main() 27 { 28 int n,num1,num2; 29 while(~scanf("%d",&n)) 30 { 31 if(n==0){printf("* ");break;} 32 num1=num2=0;//num1记录有多少个不同x值,num2记录y的 33 memset(mp,0,sizeof(mp)); 34 for(int i=0;i<n;++i) 35 { 36 scanf("%lf%lf%lf%lf",&nodes[i].x1,&nodes[i].y1,&nodes[i].x2,&nodes[i].y2); 37 x[num1++]=nodes[i].x1; 38 x[num1++]=nodes[i].x2; 39 y[num2++]=nodes[i].y1; 40 y[num2++]=nodes[i].y2; 41 } 42 sort(x,x+num1); 43 sort(y,y+num2); 44 num1=unique(x,x+num1)-x;//去重 45 num2=unique(y,y+num2)-y;//去重 46 47 for(int i=0;i<n;++i) 48 { 49 //找出第i个原始大矩形覆盖的小矩形范围 50 int L_x=find(x,nodes[i].x1,num1); 51 int R_x=find(x,nodes[i].x2,num1); 52 int L_y=find(y,nodes[i].y1,num2); 53 int R_y=find(y,nodes[i].y2,num2); 54 55 for(int j=L_x;j<R_x;++j) 56 for(int k=L_y;k<R_y;++k) 57 mp[j][k]=true; 58 } 59 long long int ans=0; 60 for(int i=0;i<num1;++i) 61 for(int j=0;j<num2;++j)if(mp[i][j]) 62 ans += (x[i+1]-x[i])*(y[j+1]-y[j]); 63 printf("%lld ",ans); 64 } 65 return 0; 66 }