2015 多校联赛 ——HDU5319(模拟)
2015-07-28 20:34
288 查看
Painter
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 895 Accepted Submission(s): 408
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
Author
ZSTU
Source
2015 Multi-University Training Contest 3
按照45度刷墙,红色的从左上 ->右下,蓝色从右上->左下,一种颜色对一个点只能刷一次,红 + 蓝 ->绿
模拟即过。
(论英语的重要性!! 看半天才懂什么意思)
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <stdlib.h> using namespace std; char Map[60][60]; int main() { int n,T; // freopen("4.txt","r",stdin); scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i = 0; i < n; i++) scanf("%s",Map[i]); int i,j; int tot= 0; int len = strlen(Map[0]); for(i = 0; i < n; i++) for(j = 0; j < len; j++) { if(Map[i][j] == 'R' || Map[i][j] == 'r') { tot++; Map[i][j] = '.'; for(int k = 1; k + i < n && j + k < len; k++) { if(Map[i+k][j+k] == 'R' || Map[i+k][j+k] == 'r') Map[i+k][j+k] = '.'; else if(Map[i+k][j+k] == 'G') Map[i+k][j+k] = 'b'; else break; } } if(Map[i][j] == 'B' || Map[i][j] == 'b') { tot++; Map[i][j] = '.'; for(int k = 1; k + i < n && j - k >= 0; k++) { if(Map[i+k][j-k] == 'B' || Map[i+k][j-k] == 'b') Map[i+k][j-k] = '.'; else if(Map[i+k][j-k] == 'G') Map[i+k][j-k] = 'r'; else break; } } if(Map[i][j] == 'G') { tot+=2; Map[i][j] = '.'; for(int k = 1; k + i < n && j - k >= 0; k++) { if(Map[i+k][j-k] == 'G') Map[i+k][j-k] = 'r'; else if(Map[i+k][j-k] == 'B' || Map[i+k][j-k] == 'b') Map[i+k][j-k] = '.'; else break; } for(int k = 1; k + i < n && j + k < len ; k++) { if(Map[i+k][j+k] == 'G') Map[i+k][j+k] = 'b'; else if(Map[i+k][j+k] == 'R' || Map[i+k][j+k] == 'r') Map[i+k][j+k] = '.'; else break; } } } printf("%d\n",tot); } return 0; }
相关文章推荐
- interest_points_comparison.hdev不同检测感兴趣点的算法比较 相关例程学习
- 成员初始化列表顺序
- hdu 5289 Assignment(数学)
- ios学习(block)
- java基础之集合函数-Set
- Leetcode 152 Maximum Product Subarray
- FirstChildElement() http://baike.baidu.com/link?url=VdlvQlGU-NGLshFepuft_u3MRdjZ9CAfGhOYuL915Oo-9pb
- 中国大学MOOC-翁恺-C语言程序设计习题集 07-0 到 08-1
- Function模式 -- 深入理解javascript
- php对象转化为数组
- Block,多态,数组排序
- 电影TS、TC、SCR、R5、BD、HD等版本是什么意思
- tinypy函数调用的实现分析
- 树的孩子兄弟链表应用
- 7-28
- MongoDB数据库,windows平台的安装
- [LeetCode]Path Sum II
- 面试题26_带随机指针的链表复制
- 在Linux中运行Nancy应用程序
- Android开发的基础知识点