Back To School '16: Screensaver

View as PDF

Submit solution

All submissions

Best submissions

Points: 10

Time limit: 1.0s

Memory limit: 64M

Author:

Problem type

On the first day of school, the computer science teacher shows a couple of impressive screensavers on the computer. The screensaver called :tim: stands out to you, mainly due to the simple rules that govern :tim:.

:tim: is a beautifully rendered three-dimensional arena with a couple of walls and the observer gets to bounce off these walls. The observer occasionally bounces out of the arena, which causes the animation to start again with a new set of walls.

The arena can be represented as a grid with $N$ ~N~ columns and $M$ ~M~ rows. Empty spaces are denoted with . and walls are denoted with the character -, |, / or \. The walls are similar to mirrors; the observer hits the surface of the wall and changes to the corresponding direction. The only exception to this rule is with - and | walls. The observer bounces off - when going vertically, and passes through when going horizontally. The same exception applies when going vertically through the | wall.

One notable feature of :tim: is that whenever the user bounces on a wall, that wall rotates $90^{\circ}$ ~90^{\circ}~. For example, when the user bounces off the wall with direction |, the wall now has direction -.

Every tick, the observer moves into an adjacent cell in the grid. The player can travel horizontally or vertically, but never diagonally. The observer begins at the cell containing O (not occupied by a wall) and initially moves horizontally to the right. The animation is reset once the observer leaves the grid.

Of course, you want to implement this screensaver yourself! You have the renderer up and running, but you want the screensaver to last more than $T$ ~T~ ticks. Given the grid, can you determine whether the requirement is satisfied?

Input Specification

The first line contains the integers $N$ ~N~, $M$ ~M~ $(1 \le N,M \le 100)$ ~(1 \le N,M \le 100)~, and $T$ ~T~ $(1 \le T \le 10\,000)$ ~(1 \le T \le 10\,000)~.

On each of the next $M$ ~M~ lines, there are $N$ ~N~ characters. It is guaranteed that the character O appears exactly once.

Output Specification

If the observer stays within the grid for more than $T$ ~T~ ticks, output The observer stays within the grid.

Otherwise, output The observer leaves the grid after X tick(s).

Sample Input 1

4 4 100
O..\
....
....
.-./

Sample Output 1

The observer leaves the grid after 10 tick(s).

Sample Input 2

2 1 3
O|

Sample Output 2

The observer leaves the grid after 3 tick(s).

Sample Input 3

2 1 2
O|

Sample Output 3

The observer stays within the grid.

Comments

-5

BigBoy commented on Sept. 2, 2018, 12:00 a.m.

I am the screensaver.

This comment is hidden due to too much negative feedback. Show it anyway.

0

Ninjaclasher commented on May 20, 2017, 3:08 p.m.

Is there something about the mirrors only rotating for some of the test cases? Because if I do not include the code to make the mirrors rotate, I AC Test Case #20, but if I do, I WA it.