poj 1656 Counting Black

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.
 
代码:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int region[101][101] = {0};

void paint(int x, int y, int l, int color)
{
	for(int i = x; i <= x + l - 1; i++)
		for(int j = y; j <= y + l - 1; j++)
			region[i][j] = color;
}

int getNum(int x, int y , int l)
{
	int num = 0;
	for(int i = x; i <= x + l - 1; i++)
		for(int j = y; j <= y + l - 1; j++)
			if(region[i][j] == 1)
				num++;
	return num;
}

int main()
{
	int t,x,y,l;
	char com[6];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s %d %d %d",com,&x,&y,&l);
		if(strcmp(com,"BLACK") == 0)
		{
			paint(x,y,l,1);
		}
		else if(strcmp(com,"WHITE") == 0)
		{
			paint(x,y,l,0);
		}
		else if(strcmp(com,"TEST") == 0)
		{
			printf("%d\n",getNum(x,y,l));
		}
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值