HDU 5319 Painter(暴力枚举)
来源:互联网 发布:工兵铲推荐 知乎 编辑:程序博客网 时间:2024/05/17 23:55
http://acm.hdu.edu.cn/showproblem.php?pid=5319
Painter
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1770 Accepted Submission(s): 728
Problem Description
Mr. Hdu is an painter, as we all know, painters need ideas to innovate , one day, he got stuck in rut and the ideas dry up, he took out a drawing board and began to draw casually. Imagine the board is a rectangle, consists of several square grids. He drew diagonally, so there are two kinds of draws, one is like ‘\’ , the other is like ‘/’. In each draw he choose arbitrary number of grids to draw. He always drew the first kind in red color, and drew the other kind in blue color, when a grid is drew by both red and blue, it becomes green. A grid will never be drew by the same color more than one time. Now give you the ultimate state of the board, can you calculate the minimum time of draws to reach this state.
Input
The first line is an integer T describe the number of test cases.
Each test case begins with an integer number n describe the number of rows of the drawing board.
Then n lines of string consist of ‘R’ ‘B’ ‘G’ and ‘.’ of the same length. ‘.’ means the grid has not been drawn.
1<=n<=50
The number of column of the rectangle is also less than 50.
Output
Output an integer as described in the problem description.
Output
Output an integer as described in the problem description.
Sample Input
2
4
RR.B
.RG.
.BRR
B..R
4
RRBB
RGGB
BGGR
BBRR
Sample Output
3
6
思路:暴力枚举,具体实现看代码吧,不是很难。
下面是AC代码:
#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;char maps[550][550];int main(){ long long int t,n; scanf("%I64d",&t); while(t--) { memset(maps,'.',sizeof(maps)); scanf("%I64d",&n); getchar(); for(int i=0;i<n;i++) { scanf("%s",&maps[i]); } int m=strlen(maps[0])-1; long long int ans=0; for(int i=0;i<=n;i++) { for(int j=0;j<=m;j++) { if(maps[i][j]=='.') continue; if((maps[i][j]=='R'||maps[i][j]=='G')&&(maps[i-1][j-1]!='R'&&maps[i-1][j-1]!='G')) { ans++; } if((maps[i][j]=='B'||maps[i][j]=='G')&&(maps[i-1][j+1]!='B'&&maps[i-1][j+1]!='G')) { ans++; } } } printf("%I64d\n",ans); } return 0;}
- HDU 5319 Painter(暴力枚举)
- HDU 5319(Painter-暴力)
- HDU 5319 Painter(枚举)
- hdu 5319 Painter (2015多校第三场第4题)暴力模拟(瞎搞)
- hdu 4968(暴力枚举)
- hdu 5319 Painter(水)
- hdu 5319 Painter(DFS)
- 模拟(HDU 5319,Painter)
- hdu - 4608 - I-number(暴力枚举)
- hdu——4462(暴力枚举)
- HDU 1172 猜数字(暴力枚举)
- hdu 4445 Crazy Tank (暴力枚举)
- HDU 4445 - Crazy Tank(暴力枚举)
- HDU 5310 Hidden String(暴力枚举)
- HDU 5522 Numbers (暴力枚举)
- HDU 2335 Containers(暴力枚举)
- HDU 5778 abs (数学+暴力枚举)
- HDU 4007 Dave (暴力枚举)
- Phabricator快速搭建和使用
- 已知一对夫妇有两个孩子,如果知道有一个是男孩,那么两个都是男孩的概率?
- 【闲的蛋疼】深圳联通4G网络下,测试对比本地、香港、Los Angeles、San Francisco的连接速度
- eclipse neon安装svn4.0插件报错
- 通讯录
- HDU 5319 Painter(暴力枚举)
- Codeforces Round #282 (Div. 1) A. Treasure
- 16. 3Sum Closest
- 【字符串】C++字符串编程小结
- ROS学习之 roslaunch
- iOS 判断 当前ViewController是否正在显示
- 快速排序_泰山鲁用村里抢媳妇的故事说明这个算法
- 自定义Toast的显示时长
- leetcode_c++:链表:Rotate List(061)