HDU 1542 Atlantis 线段树 扫描线 离散化

Atlantis

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8998    Accepted Submission(s): 3856

Problem 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 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 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.

 

Sample Input

2 10 10 20 20 15 15 25 25.5 0

 

Sample Output

Test case #1 

Total explored area: 180.00

看了胡浩的线段树敲的

我改了一点地方就是我自己好理解 改的地方是把点树变成了区间树

所以更新的时候需要改变

我取的是两个闭区间

点击打开链接

#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
#define lson l , m , rt << 1
#define rson m , r , rt << 1 | 1

const int maxn = 2222;
int cnt[maxn << 2];
double sum[maxn << 2];
double X[maxn];
struct Seg {
       double h , l , r;
       int s;
       Seg(){}
       Seg(double a,double b,double c,int d) : l(a) , r(b) , h(c) , s(d) {}
       bool operator < (const Seg &cmp) const {
              return h < cmp.h;
       }
}ss[maxn];
void PushUp(int rt,int l,int r) {
       if (cnt[rt]) sum[rt] = X[r] - X[l];
       else if (l == r) sum[rt] = 0;
       else sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void update(int L,int R,int c,int l,int r,int rt) {
       if (L <= l && r <= R) {
              cnt[rt] += c;
              PushUp(rt , l , r);
              return ;
       }
       int m = (l + r) >> 1;
       if (L < m) update(L , R , c , lson);//注意一定不能等于 因为我这里是两个闭区间
       if (m < R) update(L , R , c , rson);
       PushUp(rt , l , r);
}
int Bin(double key,int n,double X[]) {
       int l = 0 , r = n - 1;
       while (l <= r) {
              int m = (l + r) >> 1;
              if (X[m] == key) return m;
              if (X[m] < key) l = m + 1;
              else r = m - 1;
       }
       return -1;
}
int main() {
       int n , cas = 1;
       while (~scanf("%d",&n) && n) {
              int m = 0;
              while (n --) {
                     double a , b , c , d;
                     scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
                     X[m] = a;
                     ss[m++] = Seg(a , c , b , 1);
                     X[m] = c;
                     ss[m++] = Seg(a , c , d , -1);
              }
              sort(X , X + m);
              sort(ss , ss + m);
              int k = 1;
              for (int i = 1 ; i < m ; i ++) {
                     if (X[i] != X[i-1]) X[k++] = X[i];
              }
              memset(cnt , 0 , sizeof(cnt));
              memset(sum , 0 , sizeof(sum));
              double ret = 0;
              for (int i = 0 ; i < m - 1 ; i ++) {
                     int l = Bin(ss[i].l , k , X);
                     int r = Bin(ss[i].r , k , X);
                     if (l <= r) update(l , r , ss[i].s , 0 , k - 1, 1);
                     ret += sum[1] * (ss[i+1].h - ss[i].h);
              }
              printf("Test case #%d\nTotal explored area: %.2lf\n\n",cas++ , ret);
       }
       return 0;
}