Codeforces 711A Bus to Udayland

原创 2016年08月30日 10:12:18

A. Bus to Udayland
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has nrows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.

ZS and Chris are good friends. They insist to get a pair of neighbouring empty seats. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of rows of seats in the bus.

Then, n lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '|') and the last two of them denote the second pair of seats in the row.

Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, 'X' denotes an occupied seat. See the sample cases for more details.

Output

If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next n lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by exactly two charaters (they should be equal to 'O' in the input and to '+' in the output).

If there is no pair of seats for Chris and ZS, print "NO" (without quotes) in a single line.

If there are multiple solutions, you may print any of them.

Examples
input
6
OO|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX
output
YES
++|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX
input
4
XO|OX
XO|XX
OX|OX
XX|OX
output
NO
input
5
XX|XX
XX|XX
XO|OX
XO|OO
OX|XO
output
YES
XX|XX
XX|XX
XO|OX
XO|++
OX|XO
Note

Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair.

O+|+X

XO|XX

OX|OO

XX|OX

OO|OO

OO|XX


题意:O代表空座,X代表有人,找到是否存在连续两个空座,改为+输出。

分析:只需要判断str[ i ] ==' O ' && str[ i-1 ] =='O';

代码如下:

#include <stdio.h>
#include <string.h>
#include <string>
string a;
char str[1010][10];
int main()
{
	int n;
	int i,j;
	scanf("%d%*c",&n);
	memset(str,0,sizeof(str));
	int peace=0;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=5;j++)
		{
			scanf("%c",&str[i][j]);
			if(!peace && str[i][j]=='O' && str[i][j-1]=='O')
			{
				peace=1;
				str[i][j]='+';
				str[i][j-1]='+';
			}
		}
		getchar();
	}
	if(peace)
	{
		printf("YES\n");
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=5;j++)
				printf("%c",str[i][j]);
			putchar('\n');
		}
	}
	else
		printf("NO\n");
	
	return 0;
} 



版权声明:本文为博主原创文章,未经博主允许不得转载。

【模拟】Codeforces 711A Bus to Udayland

题目链接:   http://codeforces.com/problemset/problem/711/A 题目大意:   N个字符串,每个字符串5位,找到第一个出现两个OO的...

codeforces——711A—— Bus to Udayland

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes inpu...

Codeforces 711A- Bus to Udayland

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes ...
  • LDUtyk
  • LDUtyk
  • 2016年08月31日 18:30
  • 375

Codeforces Problem 711A Bus to Udayland(brute force+implementation)

Codeforces Problem 711A Bus to Udayland(brute force+implementation)

【Codeforces Round #369 (Div. 2)】Codeforces 711A Bus to Udayland

模拟
  • sdfzyhx
  • sdfzyhx
  • 2016年08月30日 13:53
  • 151

Codeforces Round #369 (Div. 2) A. Bus to Udayland

codeforces ACM 模拟

Codeforces Round #369 (Div. 2) A. Bus to Udayland【模拟】

题意:公共汽车座位,每一排有四个座位,中间的 '|' 代表过道,'O' 代表空位置,'X' 代表有人座,问你能否找到两个连在一起的座位(中间有过道不算),如果可以的话吧相应的符号变为 '+'。 简单模...

A.Bus to Udayland

题目:ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on t...
  • yz12138
  • yz12138
  • 2016年08月31日 20:22
  • 49

Codeforces 711D Directed Roads(所有点出度为1的图反向边去环)

D. Directed Roads time limit per test 2 seconds memory limit per test 256 megabytes input...
  • Yasola
  • Yasola
  • 2016年08月30日 12:53
  • 580

Codeforces 711D Directed Roads

ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it co...
  • nare123
  • nare123
  • 2016年09月06日 22:25
  • 151
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 711A Bus to Udayland
举报原因:
原因补充:

(最多只允许输入30个字)