HDU 5319 Painter
来源:互联网 发布:医疗人工智能 杭州 编辑:程序博客网 时间:2024/06/04 19:35
HDU-5319
题意:画家每次只会画\ 或 /,并且用 R 画\ 用B 画/。如果一个点被BR都涂过,就会变成G。给出一张被画完的图,求它被画了几下。
解题思路:遇到B或G时判断它右上角是不是B或者G,如果都不是就代表要从这个点开始画一笔。R或G时判断左上角。
/************************************************************************* > File Name: 0722e.cpp > Author: Narsh > > Created Time: 2016年07月22日 星期五 19时52分37秒 ************************************************************************/#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;int n,t,tot,m;string s[300];int main() { scanf("%d\n",&t); s[0]=" "; while (t--) { scanf("%d\n",&n); for (int i = 1; i <= n; i++) cin>>s[i]; m=s[1].length(); for (int i = 1; i <= n; i++) { s[i]=" "+s[i]; // cout<<s[i]<<endl; } tot=0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (s[i][j] == 'G' || s[i][j]=='R') if (!(s[i-1][j-1] == 'R' || s[i-1][j-1] == 'G')) tot++; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (s[i][j] == 'G' || s[i][j] == 'B') if (!(s[i-1][j+1] == 'B' || s[i-1][j+1] == 'G')) tot++; printf("%d\n",tot); }}
0 0
- HDU 5319 Painter
- hdu 5319 Painter
- HDU 5319 Painter(模拟)
- HDU 5319 Painter
- HDU-5319 Painter
- HDU 5319 Painter(枚举)
- HDU 5319 Painter
- hdu 5319 Painter
- HDU 5319 Painter
- HDU 5319(Painter-暴力)
- HDU 5319 Painter
- HDU 5319 Painter
- Hdu 5319 Painter (模拟)
- HDU 5319 Painter
- HDU - 5319 Painter
- HDU 5319-Painter
- HDU 5319 Painter (模拟 脑洞题)
- hdu 5319 Painter(水)
- android面试专题(7)
- Poj 2492 A Bug's Life(带权并查集)(水)
- 结构化随机森林_2
- Java IO流大致总结
- mysql5.7之修改root用户的密码
- HDU 5319 Painter
- Butter Knife 使用方法
- 向HDFS上传文件时报错16/07/23 01:13:30 WARN hdfs.DFSClient: DataStreamer Exception: org.apache.hadoop.ipc.Rem
- c# listbox 实现datatable 绑定
- 007-取近似值
- HDU1253:胜利大逃亡(BFS)
- 习题17 更多文件操作
- 找规律-为什么我没有糖果?
- sd卡无法完成格式化解决办法