CodeForces 711A Bus to Udayland(水题)

原创 2016年08月30日 00:05:30
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


思路:

这道题的思路很简单,题意也很简单,找出在一块的OO,如果有输出YES并且把座位更新后输出,如果没有就输出NO。稍微分情况写一下就ok,没什么坑,很简单。


代码:

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;

char a[1000][6];

int main()
{
	//freopen("in.txt","r",stdin);
	int n;
	cin>>n;
	bool flag=false;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<5;j++)
		{
			cin>>a[i][j];
			if(j>0&&flag==false&&a[i][j-1]==a[i][j]&&a[i][j]=='O')
			{
				a[i][j]='+';
				a[i][j-1]='+';
				flag=true;
			}
		}
	}
	if(flag==false)
	{
		printf("NO\n");
	}
	else 
	{
		printf("YES\n");
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<5;j++)
		    {
			  cout<<a[i][j];
	     	}
	     	cout<<endl;
		}
	}
	return 0;	
} 




版权声明:本博客为博主编程日记,转载请注明来源。

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】【232 in total】

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】
  • my_sunshine26
  • my_sunshine26
  • 2017年07月29日 23:42
  • 1380

Codeforces 375D 数据结构(好题中的好题, 4解)

题目链接:http://codeforces.com/problemset/problem/375/D 全部代码: 题意:给你一棵树n个点,m次询问(n=100000,m=100000),每个节点有一...
  • c3568
  • c3568
  • 2014年03月25日 19:38
  • 1405

关于codeforces比赛规则介绍(转载)

Codeforces 简称: cf(所以谈论cf的时候经常被误会成TX的那款游戏). 网址: codeforces.com   这是一个俄国的算法竞赛网站,由来自萨拉托夫州立大学、由Mike Mirz...
  • y990041769
  • y990041769
  • 2014年02月19日 08:41
  • 15412

【模拟】Codeforces 711A Bus to Udayland

题目链接:   http://codeforces.com/problemset/problem/711/A 题目大意:   N个字符串,每个字符串5位,找到第一个出现两个OO的...
  • u010568270
  • u010568270
  • 2016年08月30日 14:47
  • 141

codeforces——711A—— Bus to Udayland

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes inpu...
  • lose__way
  • lose__way
  • 2017年06月14日 15:32
  • 142

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
  • 388

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

Codeforces Problem 711A Bus to Udayland(brute force+implementation)
  • queuelovestack
  • queuelovestack
  • 2016年08月30日 09:08
  • 766

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

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

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

codeforces ACM 模拟
  • qq_33248299
  • qq_33248299
  • 2016年09月02日 09:00
  • 219

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

题意:公共汽车座位,每一排有四个座位,中间的 '|' 代表过道,'O' 代表空位置,'X' 代表有人座,问你能否找到两个连在一起的座位(中间有过道不算),如果可以的话吧相应的符号变为 '+'。 简单模...
  • hurmishine
  • hurmishine
  • 2016年09月03日 20:41
  • 650
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:CodeForces 711A Bus to Udayland(水题)
举报原因:
原因补充:

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