题意:求多个矩形的面积的并
思路:经典的问题,跟前一题求矩形周长的并类似,但这里是浮点型的 要注意这一点
//188K
0MS
#include <stdio.h>
#include <math.h>
#include <algorithm>
#define L(x) (x<<1)
#define R(x) ((x<<1)+1)
#define exp 1e-6
// 这里用这个只是担心精度问题,发现这题不需要这样也行
const int M = 110;
using namespace std;
struct tree
{
int l,r,count;
//count 记录覆盖矩形的个数
double len;
//len 当前区间的合法长度
}node[M*8];
struct data
{
double x,y1,y2;
int flag;
// flag 1为入边 -1为出边
}seg[2*M];
double y[2*M];
bool cmp (data a,data b)
//x升序
{
if (a.x < b.x)
return true;
if (a.x - b.x < exp && a.flag > b.flag)
return true;
return false;
}
void BuildTree(int left,int right,int u)
{
node[u].l = left;
node[u].r = right;
node[u].count
= 0;
node[u].len = 0;
if (left + 1 == right)
return ;
int mid = (left + right)>>1;
BuildTree(left,mid,L(u));
BuildTree(mid,right,R(u));
}
void updata (int u) //更新合法长度
{
if (node[u].count > 0)
node[u].len = y[node[u].r] - y[node[u].l];
else if (node[u].l + 1 == node[u].r)
node[u].len = 0;
else
node[u].len = node[L(u)].len + node[R(u)].len;
}
void query (double left,double right,int flag,int u)
{
if (fabs(y[node[u].l] - left) < exp&&fabs(y[node[u].r] - right) < exp) //其实这里写y[node[u].l == left 也行
{
node[u].count += flag;
updata (u);
return ;
}
double mid = y[(node[u].l+node[u].r)>>1];
if (right <= mid)
query (left,right,flag,L(u));
else if (left >= mid)
query (left,right,flag,R(u));
else
{
query (left,mid,flag,L(u));
query (mid,right,flag,R(u));
}
updata (u);
}
int main ()
{
int n,i,m,count = 0;
double x1,y1,x2,y2;
while (scanf ("%d",&n)&&n)
{
m = 0;
for (i = 0;i < n;i ++)
{
scanf ("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
seg[m].x = x1,seg[m].y1 = y1,seg[m].y2 = y2;
seg[m].flag = 1,y[m++] = y1;
seg[m].x = x2,seg[m].y1 = y1,seg[m].y2 = y2;
seg[m].flag = -1,y[m++] = y2;
}
sort (seg,seg+m,cmp);
sort (y,y+m);
int cnt = unique(y,y+m) - y - 1;
//离散化
BuildTree(0,cnt,1);
double area = 0;
query (seg[0].y1,seg[0].y2,seg[0].flag,1);
for (i = 1;i < m;i ++)
{
area += node[1].len*(seg[i].x - seg[i-1].x);
query (seg[i].y1,seg[i].y2,seg[i].flag,1);
}
printf ("Test case #%d\nTotal explored area: %.2lf\n\n",++count,area);
}
}
思路:经典的问题,跟前一题求矩形周长的并类似,但这里是浮点型的 要注意这一点
//188K
#include <stdio.h>
#include <math.h>
#include <algorithm>
#define L(x) (x<<1)
#define R(x) ((x<<1)+1)
#define exp 1e-6
const int M = 110;
using namespace std;
struct tree
{
}node[M*8];
struct data
{
}seg[2*M];
double y[2*M];
bool cmp (data a,data b)
{
}
void BuildTree(int left,int right,int u)
{
}
void updata (int u)
{
}
void query (double left,double right,int flag,int u)
{
}
int main ()
{
}