C - 3

最新推荐文章于 2024-02-05 10:34:56 发布

weixin_44003830

最新推荐文章于 2024-02-05 10:34:56 发布

阅读量155

点赞数

本文链接：https://blog.csdn.net/weixin_44003830/article/details/87528137

版权

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

Output

Input

4
XO|OX
XO|XX
OX|OX
XX|OX

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

题目简述：给定n排座位，其中|表示过道，过道两边每边有两个位子，现在给定一个状态，判断是否有一个一边的两个座位都空着。
其中O表示空位，X表示有人了。
问题思路：定义二维数组进行模拟，如果a[i][0] == a[i][1] ==‘o’,那么 a[i][0] == a[i][1] ==’+’.同样a[i][3] == a[i][4] ==‘o’,那么 a[i][3] == a[i][4] ==’+’.

#include<iostream>
#include<cstdio>
char dp[1001][6];
int main() {
 int n;
 std::cin >> n;
 for (int i = 0; i < n; i++) {
  std::cin >> dp[i];
 }
 int sum = 0;
 for (int i = 0; i < n; i++) {
  if (dp[i][0] == 'O' &&dp[i][1]=='O') {
   sum = 1;
   dp[i][0] = dp[i][1] = '+';
   break;
  }
  else if (dp[i][3] == 'O' && dp[i][4] == 'O') {
   sum = 1;
   dp[i][3] = dp[i][4] = '+';
   break;
  }
 }
 if (sum == 0) {
  printf("NO\n");
 }
 else {
  printf("YES\n");
  for(int i=0;i<n;i++){
   for (int j = 0; j < 5; j++) {
    printf("%c", dp[i][j]);
   }
   printf("\n");
  }
 }
 return 0;
}