1656:Counting Black
来源:互联网 发布:淘宝怎么看下单顺序 编辑:程序博客网 时间:2024/03/29 20:16
题目链接:http://poj.org/problem?id=1656
方法:hash
思路:很简单的hash,注意方格是按照坐上的坐标定义的,然后根据规则染色就可以了。
难点:注意hash数组在何时清零很重要,本题的hash表不大,完全可以在main内声明的时候赋值为0,否则就要用到memset了
#include<cstdio>#include<iostream>#include<string>#include<cstring>using namespace std;const int MAX = 110;int main(){ int n; while(~scanf("%d",&n)) { int board[110][110] = {0}; while(n--) { string com; int x,y,l; cin>>com; scanf("%d %d %d",&x,&y,&l); if(com == "WHITE") { for(int i = x;i <= x+l-1;i++) { for(int j = y;j <= y+l-1;j++) board[i][j] = 0; } } if(com == "BLACK") { for(int i = x;i <= x+l-1;i++) { for(int j = y;j <= y+l-1;j++) board[i][j] = 1; } } int num = 0; if(com == "TEST") { for(int i = x;i <= x+l-1;i++) { for(int j = y;j <= y+l-1;j++) { if(board[i][j] == 1) num++; } } printf("%d\n",num); } } }}
0 0
- POJ 1656 Counting Black
- PKU 1656 Counting black
- poj 1656 Counting Black
- POJ 1656 Counting Black
- poj 1656 Counting Black
- poj 1656 Counting Black
- poj 1656 Counting Black
- poj 1656 Counting Black
- poj 1656 Counting Black
- POJ 1656 Counting Black
- 1656:Counting Black
- Poj 1656 Counting Black
- poj 1656 Counting Black 水题
- POJ-1656-Counting Black- 四分树
- POJ 1656 Counting Black(水~)
- poj-1656-Counting Black-(树状数组)
- poj_1656 Counting Black
- hdu_1166 Counting Black
- 一切从头开始
- 把Fortran代码自动转为C++代码
- 软件开发-Struts基础与案例开发详解
- Struts2标签-UI标签
- ssoj2424: 编码hard(dp)
- 1656:Counting Black
- C语法基础
- Java程序员应具备的技能
- 基于tomcat运行HTML5 WebSocket echo例子
- 利用html5调用本地摄像头拍照上传图片
- Java用GZIP进行简单压缩
- 剑指Offer-4-替换空格
- test8.2
- 文档共享