问题描述
思路
- 定义二维数组来表示方格
数组元素==0:该方格未被涂色,数组元素==1:该方格被涂色 - 分别对每个方块进行涂色处理,由于只是做0/1标记,重复涂色也没关系。
for( i = 0; i < n; i++){
cin >> x1 >> y1 >> x2 >> y2;
int minx = min(x1,x2);
int maxx = max(x1,x2);
int miny = min(y1,y2);
int maxy = max(y1,y2);
for( j = minx+1; j <= maxx; j++){
for( k = miny+1; k <= maxy; k++){
color[j][k] = 1;
}
}
}
注意此处“坐标”到“方块”的转换:
3. 最后遍历二维数组获得色块数量
完整代码
#include<iostream>
using namespace std;
const int N = 1000;
int color[N][N];
int main(){
int n; //矩形个数
int counter = 0; //有颜色的个数
int x1,y1,x2,y2;
int i, j, k;
cin >> n;
for( i = 0; i < 110; i++ ){
for( j = 0; j < 110; j++ ){
color[i][j] = 0;
}
}
for( i = 0; i < n; i++){
cin >> x1 >> y1 >> x2 >> y2;
int minx = min(x1,x2);
int maxx = max(x1,x2);
int miny = min(y1,y2);
int maxy = max(y1,y2);
for( j = minx+1; j <= maxx; j++){
for( k = miny+1; k <= maxy; k++){
color[j][k] = 1;
}
}
}
for( i = 0; i <110; i++){
for( j = 0; j < 110; j++){
if( color[i][j] == 1)
counter++;
}
}
cout << counter;
return 0;
}