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

题目大意：已知客车上座位情况，例如 “O O | X X ” 的意思是 “|” 为过道，以过道为中点，左右个为一组pair，O代表empty，X代表已被占座。要求给出是否有存在一组pair空座位给这两个人坐。如果有的话输出YES，并将最新的座位分布图打印出来，这两个乘客坐的位置用++以示区分。若没有，直接输出NO。

解题思路：这道题相当简单，仅需对每行的座位进行扫描，是否存在“OO”，若有做个标记，若没有则输出NO。

    在此我用的是java字符串 contains( CharSequence arg0) 来判断哪一行存在“OO”，若找到的话，用replaceFirst(String regex, String replacement)来处理，最后打印输出即可。

以下为解题代码（java实现）

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		scanner.nextLine();
		String[] strings = new String[n];
		
		for(int i = 0;i < n;i++){
			strings[i] = scanner.nextLine();
		}
		
		int row = 0;
		boolean flag = false;
		for(int i = 0;i < n;i++){
			if(strings[i].contains("OO")){
				row = i;
				flag = true;
				break;
			}
		}
		if(flag){
			String str = strings[row].replaceFirst("OO", "++");
			System.out.println("YES");
			for(int i = 0;i < n;i++){
				if(i == row){
					System.out.println(str);
				}else{
					System.out.println(strings[i]);
				}			
			}
		}else{
			System.out.println("NO");
		}		
	}
}