Codeforces Round #369 (Div. 2) A. Bus to Udayland （水题）

Bus to Udayland

题目链接：

http://codeforces.com/contest/711/problem/A

Description

``` 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 n rows 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?

</big>


 




##Input
<big>

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.

</big>






##Output
<big>

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.

</big>


 
 
##Examples
<big>

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

</big>


##Note
<big>

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

</big>



<br/>
##题意：
<big>
找有没有相邻座位.
</big>


<br/>
##题解：
<big>
暴力判断一下即可.
</big>




<br/>
##代码：
``` cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <list>
#define LL long long
#define eps 1e-8
#define maxn 101000
#define mod 100000007
#define inf 0x3f3f3f3f
#define mid(a,b) ((a+b)>>1)
#define IN freopen("in.txt","r",stdin);
using namespace std;

int n;
char str[1010][15];

int main(int argc, char const *argv[])
{
   // IN;

    while(scanf("%d" ,&n) != EOF)
    {
        for(int i=1; i<=n; i++) {
            scanf("%s", str[i]);
        }

        bool flag = 0;
        for(int i=1; i<=n; i++) {
            if(str[i][0] == 'O' && str[i][1] == 'O') {
                flag = 1;
                str[i][0] = '+'; str[i][1] = '+';
                break;
            }
            if(str[i][3] == 'O' && str[i][4] == 'O') {
                flag = 1;
                str[i][3] = '+'; str[i][4] = '+';
                break;
            }
        }

        if(!flag) printf("NO\n");
        else {
            printf("YES\n");
            for(int i=1; i<=n; i++) {
                printf("%s\n", str[i]);
            }
        }
    }

    return 0;
}