HDU-5319 Painter
2015-08-01 11:04
176 查看
http://acm.hdu.edu.cn/showproblem.php?pid=5319
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
Output an integer as described in the problem description.
[align=left]Sample Input[/align]
2
4
RR.B
.RG.
.BRR
B..R
4
RRBB
RGGB
BGGR
BBRR
[align=left]Sample Output[/align]
3
6
Painter
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 956 Accepted Submission(s): 435[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
Output an integer as described in the problem description.
[align=left]Sample Input[/align]
2
4
RR.B
.RG.
.BRR
B..R
4
RRBB
RGGB
BGGR
BBRR
[align=left]Sample Output[/align]
3
6
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 55; int N,m; char G[maxn][maxn]; bool check(char a, char b) { if(a == b || a == 'G') return true; else return false; } int solve() { int ret = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < m; j++) { if (check(G[i][j], 'R') && !check(G[i-1][j-1], 'R')) ret++; if (check(G[i][j], 'B') && !check(G[i-1][j+1], 'B')) ret++; } } return ret; } int main () { int cas; scanf("%d", &cas); while(cas--) { scanf("%d", &N); memset(G, 0, sizeof(G)); for (int i = 0; i < N; i++) scanf("%s", G[i]); m = strlen(G[0]) ; printf("%d\n", solve()); } return 0; }
相关文章推荐
- EAGAIN、EWOULDBLOCK、EINTR与非阻塞 长连接
- hdu 1151 Air Raid(最小路径覆盖)
- 获得手势所在的图片坐标 & CGRectContainsPoint
- hdu 5335 Walk Out(bfs+斜行递推) 2015 Multi-University Training Contest 4
- 2015 Multi-University Training Contest 2
- hdu2473 Junk-Mail Filter
- 基础知识:开漏(open drain)和开集(open collector)
- 可视化存储智能解决方案之一“大话Raid2.0”
- Submission Details
- Xcode failed to get reply to handshake packet
- rails 学习第一天笔记
- hd1789 Doing Homework again
- Aircrack-ng支持网卡列表(下)
- Convolutional Neural Networks at Constrained Time Cost(精读)
- 1022:Train Problem I
- Visualization of Detail Point Set by Local Algebraic Sphere Fitting
- Visual Studio 2008 Package Load Failure:未能正确加载包“Microsoft.VisualStudio.Xaml”
- hdu 5293 Tree chain problem(树链剖分+树形dp)
- HUAS Summer Trainning #3~E
- Hdu 1789 Doing Homework again