CF926D.Choose Place

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A classroom in a school has six rows with 33 desks in each row. Two people can use the same desk: one sitting on the left and one sitting on the right.

Some places are already occupied, and some places are vacant. Petya has just entered the class and wants to occupy the most convenient place. The conveniences of the places are shown on the picture:

Here, the desks in the top row are the closest to the blackboard, while the desks in the bottom row are the furthest from the blackboard.

You are given a plan of the class, where '*' denotes an occupied place, '.' denotes a vacant place, and the aisles are denoted by '-'.

Find any of the most convenient vacant places for Petya.

输入格式

The input consists of 66 lines. Each line describes one row of desks, starting from the closest to the blackboard. Each line is given in the following format: two characters, each is '*' or '.' — the description of the left desk in the current row; a character '-' — the aisle; two characters, each is '*' or '.' — the description of the center desk in the current row; a character '-' — the aisle; two characters, each is '*' or '.' — the description of the right desk in the current row. So, the length of each of the six lines is 88 .

It is guaranteed that there is at least one vacant place in the classroom.

输出格式

Print the plan of the classroom after Petya takes one of the most convenient for him places. Mark this place with the letter 'P'. There should be exactly one letter 'P' in the plan. Petya can only take a vacant place. In all other places the output should coincide with the input.

If there are multiple answers, print any.

输入输出样例

  • 输入#1

    ..-**-..
    ..-**-..
    ..-..-..
    ..-..-..
    ..-..-..
    ..-..-..
    

    输出#1

    ..-**-..
    ..-**-..
    ..-..-..
    ..-P.-..
    ..-..-..
    ..-..-..
    
  • 输入#2

    **-**-**
    **-**-**
    ..-**-.*
    **-**-**
    ..-..-..
    ..-**-..
    

    输出#2

    **-**-**
    **-**-**
    ..-**-.*
    **-**-**
    ..-P.-..
    ..-**-..
    
  • 输入#3

    **-**-*.
    *.-*.-**
    **-**-**
    **-**-**
    ..-..-..
    ..-**-..
    

    输出#3

    **-**-*.
    *.-*P-**
    **-**-**
    **-**-**
    ..-..-..
    ..-**-..
    

说明/提示

In the first example the maximum convenience is 33 .

In the second example the maximum convenience is 22 .

In the third example the maximum convenience is 44 .

首页