There is a board with
来源:互联网 发布:老九门 网络销售价格 编辑:程序博客网 时间:2024/06/07 12:46
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:
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)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)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
#include<stdio.h>#include<string.h>char arr[1050][1000],m;int brr[1050][40],ans[105]={0,0},num=0,map[1005][1005]={0,0};void Wasd(int a,int b,int c){ int x,y,i,j; x=a+c-1; y=b+c-1; for(i=a;i<=x;i++) for(j=b;j<=y;j++) map[i][j]=0;}void Basd(int a,int b,int c){ int x,y,i,j; x=a+c-1; y=b+c-1; for(i=a;i<=x;i++) for(j=b;j<=y;j++) map[i][j]=1;}void Tasd(int a,int b,int c){ int x,y,i,j; x=a+c-1; y=b+c-1; for(i=a;i<=x;i++) for(j=b;j<=y;j++) if(map[i][j]==1) { ans[num]++; } num++;}int main(){ int n,k,l,i,j,size; scanf("%d",&n); scanf("%c",&m); for(i=0;i<n;i++) { gets(arr[i]); brr[i][0]=strlen(arr[i]); } for(i=0;i<n;i++) { k=1; for(j=4;j<brr[i][0];j++) { if(arr[i][j]>='0'&&arr[i][j]<='9') { if(arr[i][j+1]>='0'&&arr[i][j+1]<='9') { brr[i][k++]=(arr[i][j]-'0')*10+(arr[i][j+1]-'0'); if(arr[i][j+2]>='0'&&arr[i][j+2]<='9') { brr[i][k-1]=100; j++; } j++; } else { brr[i][k++]=arr[i][j]-'0'; } } } } for(l=0;l<n;l++) { if(arr[l][0]=='W') Wasd(brr[l][1],brr[l][2],brr[l][3]); if(arr[l][0]=='B') Basd(brr[l][1],brr[l][2],brr[l][3]); if(arr[l][0]=='T') Tasd(brr[l][1],brr[l][2],brr[l][3]); } for(i=0;i<num;i++) printf("%d\n",ans[i]); return 0;}
- There is a board with
- there is a reason
- Where there is a will,there is a way...
- Where there is a will, there is a way
- There is a problem with the configuration server. (/usr/libexec/gconf-sanity-check-2 exite
- There is a problem with this website’s security certificate in IE
- There is a problem with the configuration server.(usr/lib/libgconf2-4/gconf-sanity-check-2 ...)
- where there is internet ,there is a way
- There is a problem with the configuration server. (/use/lib/GConf/2/gconf-sanity-check-2 exited with
- Win10安装Python出错: there is a problem with widows installer package,a program run as part of setup di
- There is a code,i'm puzzled
- THERE IS A FAULT IN REALITY!
- Is there a unique Android device ID?
- Is there a unique Android device ID?
- HDU 2435 There is a war
- there is a problem parsing the package
- There is a circle错误,json转换
- There is a cycle in the hierarchy
- R语言RMySQL包的使用注意事项
- storyboard之 Segue
- 单链表经典面试题
- 汇编浮点运算指令集
- java开发环境配置
- There is a board with
- 【版本二】手动将jar添加到maven仓库中
- python中一些比较实用的小技巧
- 【黑马程序员】【Foundation框架】字典NSDictionary和NSMutableDictionary
- BZOJ水题
- Copy List with Random Pointer
- java23种设计模式之单例模式
- R里面的tryCatch
- DataTable 两种ajax方式