poj 1656 Counting Black

最新推荐文章于 2017-08-25 21:12:18 发布

JinbaoSite0144

最新推荐文章于 2017-08-25 21:12:18 发布

阅读量789

点赞数

分类专栏： OJ编程文章标签： poj zoj c++ 算法编程

本文链接：https://blog.csdn.net/codeforcer/article/details/42266659

版权

OJ编程专栏收录该内容

81 篇文章

订阅专栏

本文介绍了一个关于100*100棋盘的问题，通过BLACK、WHITE和TEST三种指令对棋盘进行操作，具体包括染色和查询黑色格子数量。文章提供了一段参考代码实现这些功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Counting Black

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 10360		Accepted: 6691

Description

There is a board with 100 * 100 grids as shown below. The left-top gird is denoted as (1, 1) and the right-bottom grid is (100, 100).

We may apply three commands to the board:

1.	WHITE  x, y, L     // Paint a white square on the board, 

                           // the square is defined by left-top grid (x, y)

                           // and right-bottom grid (x+L-1, y+L-1)



2.	BLACK  x, y, L     // Paint a black square on the board, 

                           // the square is defined by left-top grid (x, y)

                           // and right-bottom grid (x+L-1, y+L-1)



3.	TEST     x, y, L    // Ask for the number of black grids 

                            // in the square (x, y)- (x+L-1, y+L-1)

In the beginning, all the grids on the board are white. We apply a series of commands to the board. Your task is to write a program to give the numbers of black grids within a required region when a TEST command is applied.

Input

The first line of the input is an integer t (1 <= t <= 100), representing the number of commands. In each of the following lines, there is a command. Assume all the commands are legal which means that they won't try to paint/test the grids outside the board.

Output

For each TEST command, print a line with the number of black grids in the required region.

Sample Input

5
BLACK 1 1 2
BLACK 2 2 2
TEST 1 1 3
WHITE 2 1 1
TEST 1 1 3

Sample Output

7
6

题意：

对于一个100*100棋盘，进行下列三种操作

BLACK x y l 将(x,y)为左上角，边长为l的正方形涂黑

WHITE x y l 将(x,y)为左上角，边长为l的正方形涂白

TEST x y l 问(x,y)为左上角，边长为l的正方形有多少个黑色格子

参考代码：

#include <iostream>
#include <string.h>
using namespace std;
#define MAX 100
int main(){
	int map[MAX][MAX];
	int t,x,y,l;
	char s[20];
	while (cin>>t){
		memset(map,0,sizeof(map));
		while (t--){
			cin>>s>>x>>y>>l;
			if (strcmp(s,"BLACK")==0){
				for (int i=x;i<x+l;i++){
					for (int j=y;j<y+l;j++){
						map[i][j]=1;
					}
				}
			}
			if (strcmp(s,"WHITE")==0){
				for (int i=x;i<x+l;i++){
					for (int j=y;j<y+l;j++){
						map[i][j]=2;
					}
				}
			}
			if (strcmp(s,"TEST")==0){
				int count=0;
				for (int i=x;i<x+l;i++){
					for (int j=y;j<y+l;j++){
						if (map[i][j]==1)
							count++;
					}
				}
				cout<<count<<endl;
			}
		}
	}
	return 0;
}

每天水一发~