poj 1656 Counting Black
Counting Black
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 8396
Accepted: 5398
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
1: #include<iostream>
2: using namespace std;
3: int main()
4: {
5: char grid[102][102];
6:
7: char command[10];
8: int n;
9: int x,y,l;
10: int i,j;
11: int sum;
12: for(i=0;i<102;i++)
13: {
14: for(j=0;j<102;j++)
15: {
16: grid[i][j]='w';
17: }
18: }
19: cin>>n;
20: while(n--)
21: {
22: cin>>command;
23: if(strcmp(command,"BLACK")==0)
24: {
25: cin>>x>>y>>l;
26: for(i=x;i<=x+l-1;i++)
27: {
28: for(j=y;j<=y+l-1;j++)
29: grid[i][j]='b';
30: }
31: }
32: else if(strcmp(command,"WHITE")==0)
33: {
34: cin>>x>>y>>l;
35: for(i=x;i<=x+l-1;i++)
36: {
37: for(j=y;j<=y+l-1;j++)
38: grid[i][j]='w';
39: }
40: }
41: else if(strcmp(command,"TEST")==0)
42: {
43: cin>>x>>y>>l;
44: sum=0;
45: for(i=x;i<=x+l-1;i++)
46: {
47: for(j=y;j<=y+l-1;j++)
48: {
49: if(grid[i][j]=='b')
50: sum++;
51: }
52: }
53: cout<<sum<<endl;
54: }
55: }
56: return 0;
57: }
58:
