/*
Atlantis
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define lson (pos<<1)
#define rson (pos<<1|1)
const int maxn = 2005;
int cnt,ret;
struct Seg{
double a,b,h;
int c;
Seg(double a = 0,double b = 0,double h = 0,int c = 0):
a(a),b(b),h(h),c(c){};
friend bool operator < (Seg p,Seg q){
return p.h < q.h;
}
}seg[maxn];
double Hash[maxn];
void Hash_init(){
sort(Hash,Hash + ret);
ret = unique(Hash,Hash + ret) - Hash;
}
int HASH(double t){
return lower_bound(Hash,Hash + ret,t) - Hash;
}
struct Node{
int l,r,col;
double sum;
int mid(){
return (l + r) >> 1;
}
double len(){
return Hash[r + 1] - Hash[l];
}
}node[maxn << 2];
void build(int l,int r,int pos){
node[pos].l = l;
node[pos].r = r;
node[pos].col = 0;
node[pos].sum = 0;
if(l == r) return;
int mid = node[pos].mid();
build(l,mid,lson);
build(mid + 1,r,rson);
}
void pushup(int pos){
if(node[pos].col){
node[pos].sum = node[pos].len();
}
else if(node[pos].l == node[pos].r){
node[pos].sum = 0;
}
else{
node[pos].sum = node[lson].sum + node[rson].sum;
}
}
void update(int l,int r,int pos,int d){
if(l <= node[pos].l && node[pos].r <= r){
node[pos].col += d;
pushup(pos);
return;
}
int mid = node[pos].mid();
if(l <= mid)
update(l,r,lson,d);
if(r > mid)
update(l,r,rson,d);
pushup(pos);
}
int main(){
int n,Case = 1;
while(scanf("%d",&n) && n){
double a,b,c,d;
cnt = 0;
ret = 0;
for(int i = 0; i < n; i++){
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
seg[cnt++] = Seg(a,c,b,1);
seg[cnt++] = Seg(a,c,d,-1);
Hash[ret++] = a;
Hash[ret++] = c;
}
Hash_init();
build(0,ret,1);
sort(seg,seg + cnt);
double ans = 0;
for(int i = 0; i < cnt - 1; i++){
int l = HASH(seg[i].a), r = HASH(seg[i].b) - 1, c = seg[i].c;
update(l,r,1,c);
ans += node[1].sum * (seg[i + 1].h - seg[i].h);
}
printf("Test case #%d\n",Case++);
printf("Total explored area: %.2f\n\n",ans);
}
return 0;
}
HDU 1542
最新推荐文章于 2023-01-11 09:55:03 发布