一、题目
2779:Counting Black
- 时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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. - 输入
- 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.
- 输出
- For each TEST command, print a line with the number of black grids in the required region.
- 样例输入
-
5 BLACK 1 1 2 BLACK 2 2 2 TEST 1 1 3 WHITE 2 1 1 TEST 1 1 3
- 样例输出
-
7 6
二、分析
建立数组按指令模拟操作
三、AC源代码
1 #include <stdio.h>
2 int main()
3 {
4 int n,i,j,x,y,l,count;
5 char color[6];
6 int grid[100][100]={0};
7 scanf("%d",&n);
8 while(n--)
9 {
10 count=0;
11 scanf("%s%d%d%d",color,&x,&y,&l);
12 for(i=x;i<x+l;i++)
13 for(j=y;j<y+l;j++)
14 if(color[0]=='B')
15 grid[i][j]=1;
16 else if (color[0]=='W')
17 grid[i][j]=0;
18 else if(grid[i][j]==1)
19 count++;
20 if(color[0]=='T')
21 printf("%d\n",count);
22 }
23 return 0;
24 }
