题意:每行给出4个数字,分别为两个坐标值,这两个坐标为一个矩形的对角坐标,也就是说,这4个数字代表两个坐标从而确定了一个矩形。。当4个数字都为-1时,表示一组数据结束;当4个数字都为-2时,表示程序结束。求的是一组数据的各个矩形并下来覆盖的面积。
这道题目我用hash暴力解决:
#include <cstdio>
#include <cstring>
bool rectangle[109][109];
int main()
{
int a, b, c, d, result = 0;
while (scanf("%d%d%d%d", &a, &b, &c, &d), 1)
{
if (a < 0)
{
printf("%d\n", result);
if (a == -2) break;
result = 0;
memset(rectangle, false, sizeof rectangle);
}
if (a > c) a^=c^=a^=c;
if (b > d) b^=d^=b^=d;
for (int i = a; i < c; ++i)
for (int j = b; j < d; ++j)
if (rectangle[i][j] == false) rectangle[i][j] = true, ++result;
}
return 0;
}
当然也可以用线段树离散化来求解:
/*
线段树求矩形面积的并(离散化下先)
把X坐标排序离散,枚举每一个区间,然后扫描线段树,求的覆盖的Y的长度
然后 (X[i+1]-X[i]) *L 即是所求面积
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define NN 300
#define Swap(a,b) (a=a^b,b=b^a,a=a^b)
struct node{
int r,l,val;
}seg_tree[NN];
struct Link{
int low_x,low_y,high_x,high_y;
}link[NN];
int X[NN];
int len_l,len_seg,len_x,val,get_ans;
int cmp(const void *a,const void *b){
return *(int *)a - *(int *)b;
}
void Init(int root,int l,int r)
{
int mid = (l+r)>>1;
seg_tree[root].l = l;
seg_tree[root].r = r;
seg_tree[root].val = 0;
len_seg = len_seg < root ? root : len_seg;
if(r-l == 1)return ;
Init(root*2,l,mid);
Init(root*2+1,mid,r);
}
void insert(int root ,int l,int r){
int mid = (seg_tree[root].l+seg_tree[root].r)>>1;
if(root > len_seg ) return ;
if(l <= seg_tree[root].l && r >= seg_tree[root].r)
seg_tree[root].val = val;
else if(r<=mid)insert(root*2,l,r);
else if(l>=mid)insert(root*2+1,l,r);
else {
insert(root*2,l,mid);
insert(root*2+1,mid,r);
}
return ;
}
void get_seg(int root)
{
if(root > len_seg ) return ;
if(seg_tree[root].val == val){ //用来区分不同区间的Y的长度
get_ans+=(seg_tree[root].r-seg_tree[root].l);
return ;
}
get_seg(root*2);
get_seg(root*2+1);
}
int main()
{
int i,j,ans,x1,x2,y1,y2;
Init(1,0,100);
while(scanf("%d%d%d%d",&x1,&y1,&x2,&y2)){
ans=len_l=len_x=0;
if(x1>x2)Swap(x1,x2);
if(y1>y2)Swap(y1,y2);
X[len_x++] = x1;
X[len_x++] = x2;
link[len_l].low_x = x1;
link[len_l].low_y = y1;
link[len_l].high_x = x2;
link[len_l++].high_y=y2;
while(scanf("%d%d%d%d",&x1,&y1,&x2,&y2)){
if(x1 == -1 || x1 == -2)break;
if(x1>x2)Swap(x1,x2);
if(y1>y2)Swap(y1,y2);
X[len_x++] = x1;
X[len_x++] = x2;
link[len_l].low_x = x1;
link[len_l].low_y = y1;
link[len_l].high_x = x2;
link[len_l++].high_y=y2;
}
qsort(X,len_x,sizeof(int),cmp);
for(i=0;i<len_x-1;i++){
if(X[i] == X[i+1])continue;
val++;//保证了不同区间 线段树中val的值的不同,达到一次建树,多次使用的效果!
for(j=0;j<len_l;j++){
if(link[j].low_x <= X[i] && link[j].high_x >= X[i+1])
insert(1,link[j].low_y,link[j].high_y);
}
get_ans=0;
get_seg(1);
ans += (X[i+1]-X[i])*get_ans;
}
printf("%d\n",ans);
if(x1 == -2)break;
}
return 0;
}