codeforces——711A—— 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 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?
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
옆자리를 찾을 수 있느냐고 물으니 1조 좌석을 표시해 주세요.그리고 요구에 따라 출력한다.
좀 많이 썼습니다. 문자열이 줄 바꾸기 · · 문자를 보류하지 않을 때 문자열을 사용하면 코드를 간소화할 수 있습니다.물 문제는 고치기 귀찮다.

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        getchar();
        int TOW=0,x=4;
        char s[7000]={'Y','E','S','
'};
        while(n--)
        {
            char c1,c2,c3;
            cin>>c1>>c2>>c3;
            if(c1=='O'&&c2=='O'&&TOW==0)
            {
                TOW=1;
                c1=c2='+';
            }
            s[x++]=c1;
            s[x++]=c2;
            s[x++]=c3;
            cin>>c1>>c2;
            if(c1=='O'&&c2=='O'&&TOW==0)
            {
                TOW=1;
                c1=c2='+';
            }
            s[x++]=c1;
            s[x++]=c2;
            s[x++]='
';
        }
        if(TOW==0)
            cout<

이 내용에 흥미가 있습니까?

현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:

Codeforces Round #715 Div. 2C The Sports Festival: 구간 DP전형

구간 DP의 초전형. 이하, 0-indexed. 입력을 정렬하여 어디서나 시작하고 최적으로 좌우로 계속 유지하면 좋다는 것을 알 수 있습니다. {2000})$의 주문이 된다. 우선, 입력을 소트하여 n개의 요소를 $...

텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.

CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.

codeforces——711A—— Bus to Udayland

좋은 웹페이지 즐겨찾기