Painter（模拟）

最新推荐文章于 2017-12-11 23:39:01 发布

原创最新推荐文章于 2017-12-11 23:39:01 发布 · 939 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #算法

ACM 同时被 3 个专栏收录

521 篇文章

订阅专栏

模拟

181 篇文章

订阅专栏

c基础编程

173 篇文章

订阅专栏

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5319

Painter

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 692 Accepted Submission(s): 315

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

Source

2015 Multi-University Training Contest 3

AC code：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<cmath>
#define LL long long
#define MAXN 1000010
using namespace std;
char board[55][55];
int n,m;
int main()
{
	int t,i,j,ans;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++)
		{
			scanf("%s",board[i]+1);
		}
		m=strlen(board[1]+1);
		ans=0;
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=m;j++)
			{
				if(board[i][j]=='R'||board[i][j]=='G')
				{
					if(board[i-1][j-1]!='R'&&board[i-1][j-1]!='G')
						ans++;
				}
				if(board[i][j]=='B'||board[i][j]=='G')
				{
					if(board[i-1][j+1]!='B'&&board[i-1][j+1]!='G')
					{
						ans++;
					}
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
 }