hdu5319 Painter(模拟题)
来源:互联网 发布:火烧赤壁的网络意思 编辑:程序博客网 时间:2024/05/29 03:32
C - Painter
HDU - 5319Mr. 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.
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.
24RR.B.RG..BRRB..R4RRBBRGGBBGGRBBRR
36
只能斜着画,如果某个位置是R 如果其左上角是R或者G 证明不用再多划一笔 如果是B 其右上角如果是B或者G 那也不用再多画一次 如果是G 那其左上角如果是R或者G 右上角如果是B或者G 就都不用多画一次了 大概照着这个思维打了一下 一直wa 后来发现是因为输入的N并不是代表N*N的矩阵 坑啊。。。。是输入N行 每行长度自定。。好吧没好好审题 改了之后就AC了。
#include<iostream>#include<string.h>#include<cstdio>using namespace std;char mp[100][100];int main() {int t,n;cin>>t;while(t--) {cin>>n;memset(mp,0,sizeof(mp));for(int i=1; i<=n; i++)scanf("%s",mp[i]+1);int m=strlen(mp[1]+1);int ans=0;for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) {if(mp[i][j]=='R')if(!(mp[i-1][j-1]=='R'||mp[i-1][j-1]=='G')) ans++;}for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) {if(mp[i][j]=='B')if(!(mp[i-1][j+1]=='B'||mp[i-1][j+1]=='G')) ans++;}for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) {if(mp[i][j]=='G')if(!(mp[i-1][j-1]=='R'||mp[i-1][j-1]=='G')) ans++;}for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) {if(mp[i][j]=='G')if(!(mp[i-1][j+1]=='B'||mp[i-1][j+1]=='G')) ans++;} cout<<ans<<endl;}}
阅读全文
0 0
- hdu5319 Painter(模拟题)
- hdu5319 Painter(模拟)
- hdu5319 Painter(模拟)
- HDU5319.Painter
- hdu5319 Painter
- hdu5319 Painter
- HDU5319 Painter
- hdu5319 模拟水题
- HDU5319 Painter(深搜DFS)
- hdu5319(模拟)
- 解题报告 之 HDU5319 Painter
- hdu5319 简单模拟
- hdu5319(2015多校3)--Painter(暴力,,,)
- 2015多校联合训练第三场Painter(hdu5319)
- HDU5319
- hdu 5319 Painter(模拟题)
- HDU 5319 Painter(模拟)
- Painter(模拟)
- cnpm不是内部命令的解决方案:配置环境变量
- 第四次小组讨论 (代码规范)
- 大数据环境搭建
- PyQt5学习笔记6_QTableView中嵌入按钮
- Hello World!
- hdu5319 Painter(模拟题)
- 省选专练ZJOI2004书架
- redis的安装及jedis的jar包下载地址
- 三元组,二元组,排列组合
- NO1 拷贝构造函数
- [LeetCode] 121. Best Time to Buy and Sell Stock ❤
- [luogu]P1631序列合并-堆排的套路运用
- Android:WebView的全面解析
- JavaScript基础(3)—— Javascript事件