zoj1128 Atlantis(离散)

Atlantis Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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 file 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 it1.

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.

题意：    大意是给定平面上的n个矩形（坐标为整数，矩形与矩形之间可能有重叠的部分），求其覆盖的总面积。

分析：由于坐标范围很大，我们可以将坐标范围“离散化”到1到200之间的数，于是一个200*200的二维数组就足够了。

代码

const
  maxn=200;
var
  x,y:array[0..maxn] of real;
  rect:array[0..maxn,1..4] of real;
  n,i,j,p,q:longint;
  ans,xi,yi,xj,yj:real;


procedure sort;
var
  i,j:longint;
begin
  for i:=1 to 2*p-1 do
    for j:=i+1 to 2*p do
      begin
        if x[i]>x[j] then
          begin
            x[0]:=x[i];x[i]:=x[j];x[j]:=x[0];
          end;
        if y[i]>y[j] then
          begin
            y[0]:=y[i];y[i]:=y[j];y[j]:=y[0];
          end;
      end;
end;


procedure main;
var
  i,j,k:longint;
begin
  for i:=1 to 2*p do
    for j:=1 to 2*p do
      for k:=1 to p do
        if (x[i]>rect[k,1]) and (x[i]<=rect[k,3]) and
          (y[j]>rect[k,2]) and (y[j]<=rect[k,4]) then
            begin
              ans:=ans+(x[i]-x[i-1])*(y[j]-y[j-1]);
              break;
            end;
end;


begin
  readln(n);
  while n<>0 do
    begin
      ans:=0;
      p:=0;
      inc(q);
      for i:=1 to n do
        begin
          readln(xi,yi,xj,yj);
          if (xi=xj) or (yi=yj)
            then continue;
          inc(p);
          rect[p,1]:=xi;rect[p,2]:=yi;
          rect[p,3]:=xj;rect[p,4]:=yj;
          x[2*p-1]:=xi;x[2*p]:=xj;
          y[2*p-1]:=yi;y[2*p]:=yj;
        end;
      sort;
      main;
      writeln('Test case #',q);
      writeln('Total explored area: ',ans:0:2);
      writeln('');writeln(''); 
      readln(n);
    end;
end.