Coldplay

ACM——菜鸡的坚持之路

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

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;
}



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013555159/article/details/52357243
上一篇Codeforces Round #369 (Div. 2) B. Chris and Magic Square
下一篇算法学习之 图的割点
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭