PKU 1656 Counting black

来源：互联网发布：怎样在淘宝上查询类目编辑：程序博客网时间：2024/04/20 09:19

Counting Black

Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6903Accepted: 4387

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

Source

POJ Monthly--2004.05.15 Liu Rujia@POJ

一道很简单的模拟题~一次水过~

//模拟题目 #include <iostream>#include <string>#define maxn 102using namespace std;bool matrix[maxn][maxn];int main(){    string command;    int num;    int x,y,l;    int i,j;    cin>>num;    memset(matrix,0,sizeof(matrix));    while(num--)    {        cin>>command;        cin>>x>>y>>l;        if(command=="BLACK")        {            for(i=x;i<=x+l-1;i++)            {                for(j=y;j<=y+l-1;j++)                {                    matrix[i][j]=1;                }            }        }        if(command=="WHITE")        {            for(i=x;i<=x+l-1;i++)            {                for(j=y;j<=y+l-1;j++)                {                    matrix[i][j]=0;                }            }        }        if(command=="TEST")        {            int sum=0;            for(i=x;i<=x+l-1;i++)            {                for(j=y;j<=y+l-1;j++)                {                    if(matrix[i][j])                        sum++;                }            }            cout<<sum<<endl;        }    }    //system("pause");    return 0;}