## COCI '06 Contest 6 #4 Kamen

View as PDF

Points: 15 (partial)
Time limit: 0.6s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

For nearly two weeks now, Domeniko has been lying in his bed because his friend Nedjeljko accidentally threw a large rock on his left foot. As Domeniko has already solved the tasks from all Croatian national competitions since 1998, he has to find a new way to kill time.

Domeniko's new game is played on an board. Initially every square is either empty or blocked by a wall. Domeniko throws a rock into the board by putting it in the topmost row of a column and then letting gravity do the rest.

Gravity works as follows:

• If the square under the rock is a wall or if the rock is in the bottom row of a column, then the rock remains there.
• If the square under the rock is empty, then the rock moves to that square.
• If the square under the rock contains another rock, then the falling rock may slide sideways:
• If the squares left and left-down of the rock are empty, then the rock slides one square left.
• If the rock doesn't slide left and the squares to the right and right-down are empty, then the rock slides one square right.
• Otherwise, the rock remains there and never moves again.

Domeniko will never throw another rock while the previous rock hasn't settled down.

Write a program that draws the board after Domeniko throws all his rocks into the board, if we know the columns that Domeniko threw his rocks into, in order.

Note: Domeniko will never throw a rock into column in which the top row isn't empty.

#### Input Specification

The first line contains integers and , the size of the board.

Each of the following lines contains characters, the initial layout of the board. A . represents an empty field, while the uppercase letter X is a square blocked by a wall.

The next line contains an integer , the number of rocks Domeniko throws.

Each of the following lines contains an integer between and , the column into which Domeniko throws a rock (the leftmost column is column ).

Note: In of the test cases, will be no more than .

#### Output Specification

Output lines, each containing characters, the final layout of the board. Rocks should be presented with an uppercase letter O.

#### Sample Input 1

5 4
....
....
X...
....
....
4
1
1
1
1

#### Sample Output 1

....
O...
X...
....
OOO.

#### Explanation for Sample Output 1

All rocks are thrown in the first column. The first rock stops on the wall. The second rock falls on the first, slides right and stops at the bottom of the second column. The third rock falls on the first then on the second rock, slides left and rests at the bottom of the first column. The fourth rock falls on the first then on the second, then slides right.

#### Sample Input 2

7 6
......
......
...XX.
......
......
.XX...
......
6
1
4
4
6
4
4

#### Sample Output 2

......
...O..
...XX.
......
.OO...
.XX...
O..O.O