模板题。。
#include<bits/stdc++.h>
#define ll long long
#define y1 yeee
using namespace std;
const int N = 8e2;
int n, add[N], m;
double tree[N], x1, x2, y1, y2, x[N];
//以横坐标作为线段(区间),对横坐标线段进行扫描
//扫描的作用是每次更新下底边总长度和下底边个数,增加新面积
struct node {
double x1, x2, y;
int f;
node() {}
node(double l, double r, double h, int d): x1(l), x2(r), y(h), f(d) {}
bool operator <(const node &b)const {
return y < b.y;
}
} no[N];
void pushup(int rt, int l, int r) {
if(add[rt])
tree[rt] = x[r + 1] - x[l];//表示该区间整个线段长度可以作为底边
else if(l == r)
tree[rt] = 0;叶子结点则底边长度为0(区间内线段长度为0)
else
tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
void update(int L, int R, int flag, int l, int r, int rt) {
if(L <= l && r <= R) {//该区间是当前扫描线段的一部分,则该区间下底边总长以及上下底边个数差更新
add[rt] += flag;
pushup(rt, l, r);//更新底边长
return;
}
int m = (l + r) >> 1;
if(L <= m)
update(L, R, flag, l, m, rt << 1);
if(m < R)
update(L, R, flag, m + 1, r, rt << 1 | 1);
pushup(rt, l, r);
}
int main() {
int n, num = 0;
while(cin >> n && n) {
m = 0;
for(int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2;
no[m] = {x1, x2, y1, 1}, x[m++] = x1;
no[m] = {x1, x2, y2, -1}, x[m++] = x2;
}
sort(no, no + m), sort(x, x + m);
memset(tree, 0, sizeof tree), memset(add, 0, sizeof add);
int k = unique(x, x + m) - x;
double ans = 0;
for(int i = 0; i < m; i++) {
int l = lower_bound(x, x + k, no[i].x1) - x;
int r = lower_bound(x, x + k, no[i].x2) - x - 1;//x-1
update(l, r, no[i].f, 0, m, 1);//扫描线段时更新底边长度和底边相差个数
ans += tree[1] * (no[i + 1].y - no[i].y);
}
printf("Test case #%d\nTotal explored area: %.2f\n\n", ++num, ans);
}
return 0;
}