POJ1151 Atlantis 线段树

题目链接

http://poj.org/problem?id=1151

分析

扫描线求矩形面积并，以从左向右扫描为例，

将矩形拆成 $2n$ 条竖直线段，用线段树来维护当前有效长度，

遇到某个矩形左侧的线段，则尝试增加有效长度，右侧则尝试减小有效长度；

每次用有效长度乘线段间隔来累加答案。

AC代码

#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 105;

struct Line {
	int k;
	double x, y1, y2;

	bool operator < (const Line& rhs) const {
		return x < rhs.x;
	}
} line[2 * maxn];

int n, m, id;
double x1, y1, x2, y2, a[2 * maxn];

struct SegmentTree {
	int l, r, cnt;
	double len;
} t[8 * maxn];

inline void up(int p) {
	if (t[p].cnt) t[p].len = a[t[p].r + 1] - a[t[p].l];
	else if (t[p].l == t[p].r) t[p].len = 0;
	else t[p].len = t[2 * p].len + t[2 * p + 1].len;
}

void build(int p, int l, int r) {
	t[p].l = l, t[p].r = r, t[p].cnt = t[p].len = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(2 * p, l, mid);
	build(2 * p + 1, mid + 1, r);
}

void modify(int p, int l, int r, int d) {
	if (l <= t[p].l && t[p].r <= r) {
		t[p].cnt += d, up(p);
		return;
	}
	int mid = (t[p].l + t[p].r) >> 1;
	if (l <= mid) modify(2 * p, l, r, d);
	if (r > mid) modify(2 * p + 1, l, r, d);
	up(p);
}

int main() {
	while (scanf("%d", &n) == 1 && n) {
		for (int i = 1; i <= n; ++i) {
			scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
			line[i] = (Line){1, x1, y1, y2}, line[i + n] = (Line){-1, x2, y1, y2};
			a[i] = y1, a[i + n] = y2;
		}
		sort(line + 1, line + 2 * n + 1);
		sort(a + 1, a + 2 * n + 1);
		m = unique(a + 1, a + 2 * n + 1) - a - 1;
		build(1, 1, m - 1);
		double ans = 0;
		for (int i = 1; i < 2 * n; ++i) {
			int l = lower_bound(a + 1, a + m + 1, line[i].y1) - a;
			int r = lower_bound(a + 1, a + m + 1, line[i].y2) - a;
			modify(1, l, r - 1, line[i].k);
			ans += t[1].len * (line[i + 1].x - line[i].x);
		}
		printf("Test case #%d\nTotal explored area: %.2f\n\n", ++id, ans);
	}
	return 0;
}