线段树 扫描线 HDU 1255 覆盖的面积

题目链接 ： http://acm.hdu.edu.cn/showproblem.php?pid=1255

代码风格：http://www.notonlysuccess.com/index.php/segment-tree-complete/

算法：线段树 扫描线、

思路：记录下每个节点覆盖了一次的长度和覆盖了多次的长度

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stdlib.h>
using namespace std;

#define lson l, m, rt << 1 
#define rson m+1, r, rt << 1 | 1
#define mid int m = (l+r) >> 1

int cover[45454];
double w[45454];
double sum[45454], sum2[45454];
struct Seg
{
	double l, r, h;
	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;
	}
}p[45454];

void PushUp(int rt, int l, int r)
{
	if(cover[rt] >= 2)
	{
		sum2[rt] = w[r+1] - w[l];
		sum[rt] = 0;
	}
	else if(cover[rt] == 1)
	{
		if(l == r)
		{
			sum[rt] = w[r+1] - w[l];
			sum2[rt] = 0;
		}
		else
		{
			sum2[rt] = sum[rt << 1 | 1] + sum[rt << 1] + sum2[rt << 1] + sum2[rt << 1 | 1];
			sum[rt] = w[r+1] - w[l] - sum2[rt];
		}
	}
	else
	{
		if(l == r)
			sum[rt] = sum2[rt] = 0;
		else
		{
			sum[rt] = sum[rt << 1 | 1] + sum[rt << 1] ;
			sum2[rt] = sum2[rt << 1 | 1] + sum2[rt << 1];
		}
	}
}


void update(int L, int R, int k, int l, int r, int rt)
{
	if(L <= l && r <= R)
	{
		cover[rt] += k;
		PushUp(rt, l, r);
		return ;
	}	
	mid ;
	if(L <= m)
		update(L, R, k, lson);
	if(m < R)
		update(L, R, k, rson);
	PushUp(rt, l, r);
}

int bin(double key, int n)
{
	int l = 0, r = n;
	while(l <= r)
	{
		mid ;
		if(w[m] == key)
			return m;
		if(w[m] < key)
			l = m +1;
		else
			r = m-1;
	}
	return -1;
}






int main()
{
	int n, T;
	scanf("%d", &T);
	while(T -- )
	{
		double a, b, c, d;
		int i;
		scanf("%d", &n);
		int k = 0;
		for(i = 0; i < n; i ++)
		{
			scanf("%lf%lf%lf%lf", &a, &b, &c, &d);
			w[k] = a;
			p[k ++] = Seg(a, c, b, 1);
			w[k] = c;
			p[k ++] = Seg(a, c, d, -1);
		}
		sort(w, w+k);
		sort(p, p+k);
		int m = 1;
		for(i = 1; i < k; i ++)
		{
			if(w[i] != w[i-1])
				w[m ++] = w[i];
		}
		double ret = 0;
		memset(cover, 0, sizeof(cover));
		memset(sum, 0, sizeof(sum));
		memset(sum2, 0, sizeof(sum2));
		for(i = 0; i < k-1; i ++)
		{
			int ll = bin(p[i].l, m-1);
			int rr = bin(p[i].r, m-1) - 1;
			if(ll <= rr)
				update(ll, rr, p[i].s, 0, m-1, 1);
			ret += sum2[1] * (p[i+1].h - p[i].h);
		}
		printf("%.2lf\n", ret );
	}
	return 0;
}