HDU1542

//我的理解是他把y由低到高的分布建树，共建m个点，即y点的分布个数，当该点为起始点即cover>0时则加入
//计算面积，否则继续更新，为-1时则表示不可加入计算面积
//按y的分布来建树，对于每一“单位”区间的y距离，记录他的x坐标，covered>0时可加入计算 
//方法很巧的矩形并的面积
#include<iostream>
#include<cstring>
#include<algorithm> //A 
#define maxn 410
using namespace std;
struct node
{
	double y_up,y_down;
	int flag;//用int不用bool! 
	double x;

}a[maxn];
struct NODE
{
	double y_up,y_down;
	bool flag;
	double x;
	int cover;
}tree[400010];
int m;
double y[maxn];
bool cmp(node a,node b)
{
	return a.x<b.x;
} 

void build(int left,int right,int root)
{
	tree[root].y_down=y[left];
	tree[root].y_up=y[right];
	//cout<<tree[root].y_down<<" "<<tree[root].y_up<<endl; 
	tree[root].cover=0;tree[root].x=-1;tree[root].flag=0;
	if(left+1==right)
	{
		tree[root].flag=1;
	//	cout<<tree[root].y_up<<" "<<tree[root].y_down<<endl;
		return;
	} 
	int mid=(left+right)/2;
	build(left,mid,root*2);
	build(mid,right,root*2+1); //用m,r而不是m+1，r 
} 

double insert(double x,double left,double right,int root,int flag)//因为输入的x也是递增序的，实际上是x一一配对 
{
	//cout<<left<<" "<<right<<" "<<tree[root].y_up<<" "<<tree[root].y_down<<endl;
	if(left>=tree[root].y_up||right<=tree[root].y_down)//这个特判有必要么 
	return 0;
	if(tree[root].flag)//更新到叶子节点 
	{
		if(tree[root].cover>0)
		{
			double tempx=tree[root].x;
			double ans=(x-tempx)*(tree[root].y_up-tree[root].y_down);
			tree[root].x=x;
			tree[root].cover+=flag;//so so important 
			//cout<<tree[root].y_up<<" "<<tree[root].y_down<<endl;
			//cout<<tree[root].cover<<" "<<flag<<endl;
			//cout<<ans<<endl;
			return ans;
		}
		else
		{
			tree[root].x=x;
			tree[root].cover+=flag;
			//cout<<tree[root].y_up<<" "<<tree[root].y_down<<endl;
			//cout<<tree[root].cover<<" "<<flag<<endl;
			return 0;//勿忘return 0 
		} 
	}
	int mid=(left+right)/2;
	double ans1=insert(x,left,right,root*2,flag);//一开始写错的是这里，继续用left,right 
	double ans2=insert(x,left,right,root*2+1,flag);//这里注意不是用mid！ 
	return ans1+ans2;
}


int main()
{
	int kcas=0;int n;
	while(~scanf("%d",&n))
	{
		m=0;
		if(n==0)
		break;
		for(int i=1;i<=n;i++)
		{
			double x1,y1,x2,y2;
			cin>>x1>>y1>>x2>>y2;
			
			y[++m]=y1;a[m].x=x1;a[m].y_down=y1;a[m].y_up=y2;a[m].flag=1;
			y[++m]=y2;a[m].x=x2;a[m].y_down=y1;a[m].y_up=y2;a[m].flag=-1;
		}
		sort(y+1,y+m+1);
		sort(a+1,a+m+1,cmp);
		build(1,m,1); 
		double ans=0;
		for(int i=1;i<=m;i++)
		{
			//cout<<m<<endl;
			//cout<<a[i].flag<<endl;
		//cout<<m<<endl;
		//cout<<a[1].x<<" "<<a[1].y_down<<" "<<a[1].y_up<<endl;
		 ans+=insert(a[i].x,a[i].y_down,a[i].y_up,1,a[i].flag);	
		// cout<<ans<<endl;
		} 
	printf("Test case #%d\nTotal explored area: %.2f\n\n", ++kcas, ans);  //要多加一个空行 
	
	}
	return 0;
}