1、暴力法求解
2、注意用bll数组来表示地面,不然会内存超限
ps:要是再考试中还真想不到用bool数组,八成要内存超限分全部丢掉
#include <iostream>
#include <cstring>
#include <math.h>
#include <string.h>
using namespace std;
const int shu = 15000;
int n;
int x1,x2,y11,y2;
bool map[shu][shu];
int main()
{
memset(map,0,sizeof(map));
int i,j;
cin>>n;
while(n--){
cin>>x1>>y11>>x2>>y2;
int c;
if(x1>x2){
c = x1;
x1 = x2;
x2 = c;
}
if(y11>y2){
c = y11;
y11 = y2;
y2 = c;
}
for(i=x1;i<x2;i++){
for(j=y11;j<y2;j++){
map[i][j] = 1;
}
}
}
int ans = 0;
for(i=0;i<shu;i++){
for(j=0;j<shu;j++){
if(map[i][j]==1){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}