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

原创 2016年08月29日 22:45: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

</pre><br /><pre name="code" class="cpp">
//
//  main.cpp
//  Bus to Udayland
//
//  Created by 张嘉韬 on 16/8/29.
//  Copyright © 2016年 张嘉韬. All rights reserved.
//

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn=1010;
char map[maxn][5];
int main(int argc, const char * argv[]) {
    //freopen("/Users/zhangjiatao/Documents/暑期训练/input.txt","r",stdin);
    int n,flag=0;;
    scanf("%d",&n);
    char temp[10];
    for(int i=1;i<=n;i++)
    {
        scanf("%s",temp);
        map[i][0]=temp[0];
        map[i][1]=temp[1];
        if(!flag&&map[i][0]=='O'&&map[i][1]=='O')
        {
            flag=1;
            map[i][0]='+';
            map[i][1]='+';
        }
        map[i][2]=temp[2];
        map[i][3]=temp[3];
        map[i][4]=temp[4];
        if(!flag&&map[i][3]=='O'&&map[i][4]=='O')
        {
            flag=1;
            map[i][3]='+';
            map[i][4]='+';
        }
    }
    //cout<<flag<<endl;
    if(!flag) printf("NO\n");
    else
    {
        printf("YES\n");
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<=4;j++)
            {
                printf("%c",map[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}



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

相关文章推荐

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

codeforces ACM 模拟

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

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

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

模拟

Codeforces Round #369 (Div. 2)

这比赛比较坑啊,看了一下A题过了7000+人,B题直接只剩2000+人。这套题的B题非常坑,很多陷阱。 A: 水题 B: 这题就是一个幻方,但是非常坑,有这么几个坑点:1.如果n==1,随便输出一个数...

Codeforces Round #369 (Div. 2) -- C. Coloring Trees (三维DP)

大体题意: 给你n 个树,你要给这些树染色,  标号是0 表示这棵树还没有染色,标号不是0 表示这棵树已经染色 不需要再染,这片树的美丽程度是  连续相同颜色的数目! 告诉你指定美丽程度K,和  最多...

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量+组合计数

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量题目链接:[Codeforces Round #369 (Div. 2)D. D...

Codeforces Round #369 (Div. 2) 手速练习赛

一不小心打开cf发现有一场div2在20:00,感觉非常资瓷,作为一个unrated狗感觉是个很好的涨分机会,然后就去注册了。        打比赛前发现注册8000+,害怕。。。        比赛...

Codeforces Round #369 (Div. 2)

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

[Codeforces Round #369 (Div. 2) C. Coloring Trees] DP

[Codeforces Round #369 (Div. 2) C. Coloring Trees] DP题目链接:[Codeforces Round #369 (Div. 2) C. Colorin...

codeforces Round #369 (Div. 2) C. Coloring Trees (三维DP)

 C. Coloring Trees time limit per test 2 seconds memory limit per test ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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