Codeforces-711A-Bus to Udayland
2016-08-31 21:14
387 查看
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
水题,找到第一个oo,改成++,然后break 即可
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,改成++,然后break 即可
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int main() { int n; char s[1005][10]; while(scanf("%d",&n)!=EOF) { bool flag=false; for(int i=0;i<n;i++) scanf("%s",s[i]); for(int i=0;i<n;i++) { for(int j=0;j<4;j++) { if(s[i][j]=='O'&&s[i][j+1]=='O') { s[i][j]='+'; s[i][j+1]='+'; flag=true; break; } } if(flag) break; } if(flag) { puts("YES"); for(int i=0;i<n;i++) puts(s[i]); } else puts("NO"); } return 0; }
相关文章推荐
- Codeforces 711A- Bus to Udayland
- codeforces 711A.Bus to Udayland 【水题】
- codeforces 711 A. Bus to Udayland
- Codeforces刷题之路——711A Bus to Udayland
- CodeForces 711A. Bus to Udayland【StringBuilder】
- coddeforces 711A Bus to Udayland
- Codeforces 280C Game on Tree 概率dp 树上随机删子树 求删完次数的期望
- Codeforces 542F 构造
- Codeforces 78C Beaver Game(数论、博弈)
- codeforces 765E
- Codeforces 665E Beautiful Subarrays (01Trie)
- codeforces 912B.New Year's Eve
- codeforces 492D Vanya and Computer Game(额。。。数学题?水题吧)
- CodeForces 577B 模和vecto
- codeforces 276E. Little Girl and Problem on Trees (线段树)
- 【Codeforces Round 397】Codeforces 765A-D
- codeforces 835D 区间dp
- Codeforces Good Bye 2017 B. New Year and Buggy Bot 枚举全排列、模拟
- Codeforces 6A. Triangle
- 【Codeforces 282E】Sausage Maximization 中文题意&题解&代码(C++)