多校赛3- Painter
2015-07-29 19:58
302 查看
D - Painter
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
HDU 5319
Appoint description:
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
此题比较坑
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
HDU 5319
Appoint description:
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
此题比较坑
#include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <cctype> #include <string> #include <map> #include <queue> #include <stack> #include <list> #include <algorithm> using namespace std; const int MAX = 110; char s[MAX][MAX]; int len,n; void DFS_R(int i,int j) { if(i<0||i>=n||j<0||j>=len) return ; if(s[i][j]!='G'&&s[i][j]!='.'&&s[i][j]!='B') { s[i][j]='.'; DFS_R(i+1,j+1); DFS_R(i-1,j-1); } else if(s[i][j]=='G') { s[i][j]='B'; DFS_R(i+1,j+1); DFS_R(i-1,j-1); } } void DFS_B(int i,int j) { if(i<0||i>=n||j<0||j>=len) return ; if(s[i][j]!='G'&&s[i][j]!='.'&&s[i][j]!='R') { s[i][j]='.'; DFS_B(i-1,j+1); DFS_B(i+1,j-1); } else if(s[i][j]=='G') { s[i][j]='R'; DFS_B(i-1,j+1); DFS_B(i+1,j-1); } } int main() { int T; scanf("%d",&T); while(T--) { scanf("%d",&n); getchar(); for(int i=0; i<n; i++) { scanf("%s",s[i]); } len=strlen(s[0]); int sum=0; for(int i=0; i<n; i++) { for(int j=0; j<len; j++) { if(s[i][j]!='.') { if(s[i][j]=='B') { DFS_B(i,j); sum++; } else if(s[i][j]=='R') { DFS_R(i,j); sum++; } else { DFS_B(i,j); DFS_R(i,j); sum+=2; } } } } printf("%d\n",sum); } return 0; }
相关文章推荐
- 多校赛3- Painter 分类: 比赛 2015-07-29 19:58 3人阅读 评论(0) 收藏
- dlopen failed: "*.so" has unexpected e_machine
- EAGAIN、EWOULDBLOCK、EINTR与非阻塞 长连接
- hdu-5316 Magician (2015 Multi-University Training Contest 3)
- HUAS Summer Trainning #3~A
- UVa 10651 Pebble Solitaire(状态压缩DP)
- HTTP1.1中CHUNKED编码解析 http://blog.csdn.net/zhangboyj/article/details/6236780
- 2015多校第一场1006 hdu 5293 Tree chain problem
- Core Animaiton - 7
- Mybaits中Association元素使用
- uva 10976 Fractions Again(简单枚举)
- Rails 应用使用 Capistrano2 部署流程
- Rails 应用使用 Capistrano2 部署流程
- 使用dubbo2.5出现A child container failed during start
- 2015 Multi-University Training Contest 3 || HDU 5325 Crazy Bobo || 类似bfs
- HDU 5319(2015多校3)-Painter(dfs)
- Contains Duplicate
- Contains Duplicate II
- tail -f 和tail -F的区别
- HDU 5319 Painter(枚举)