CodeForces 711A. Bus to Udayland【StringBuilder】
2016-09-03 22:49
363 查看
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
output
input
output
input
output
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
第一次有CodeForces上提交JAVA代码,现在感觉学好JAVA也不是那么的容易了。只知道字符串用String,不知道用StringBuffer,StringBuilder更方便,算啦~慢慢探索,不断地充实自己才是王道。
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
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
第一次有CodeForces上提交JAVA代码,现在感觉学好JAVA也不是那么的容易了。只知道字符串用String,不知道用StringBuffer,StringBuilder更方便,算啦~慢慢探索,不断地充实自己才是王道。
相关文章推荐
- Codeforces-711A-Bus to Udayland
- codeforces 711A.Bus to Udayland 【水题】
- Codeforces刷题之路——711A Bus to Udayland
- Codeforces 711A- Bus to Udayland
- codeforces 711 A. Bus to Udayland
- codeforces 9D How many trees?(DP,注意状态表示方法)
- codeforces 543A 完全背包
- Java基础之String,StringBuilder,StringBuffer
- CodeForces 548B Mike and Fun (模拟)
- Codeforces 760A Petr and a calendar
- CodeForces 828C【构造】
- CodeForces 803A Maximal Binary Matrix-【思维+构造】
- codeforces 371B - Fox Dividing Cheese
- Codeforces 276D. Little Girl and Maximum XOR
- Codeforces 651B Beautiful Paintings【思维】
- String, StringBuffer, StringBuilder
- Codeforces 688C NP-Hard Problem【二分图】【搜索】
- Codeforces 566D Restructuring Company
- codeforces 883J Renovation 贪心,好题,有意义
- CodeForces 370C. Mittens