The cube is given to you, one face after the other as 6 grids filled with 0s and # s, where 0 represents a passage, and # represents a wall: an impassable cell. The cube can be modelized as a paper box template with 6 faces. The faces are given in that order and orientation.

The initial position and direction of Pikaptcha is given to you in the grid as a special character:

• >: facing right
• v: facing down
• <: facing left
• ^: facing up

An additional character indicates which wall Pikaptcha must follow:

• R for the wall on his right
• L for the wall on his left

We're considering the 4-adjacency, meaning a cell has a maximum of 4 adjacent cells (a diagonal cell is not adjacent). Two cells touching the same part of the edge between two faces of the cube are considered adjacent.

Pikaptcha can step over the edge of a face and continue his wall-following path on another face of the cube. For Pikaptcha to be able to step over the edge, the two cells touching that part of the edge should be passable.

You must analyze the given maze and return it with a small transformation: for each empty cell, instead of a 0, you must return the number of times Pikaptcha stepped into that cell while striding along the maze, following a wall. For each impassable cell, you change nothing: you still return #. Game ProtocolGame InputFirst line: 1 integer N for the size of the N*N*N cube.Next 6*N lines: a string line of length N where 0 is a passage and # is a wall and >, v, < or ^ is the initial position of Pikaptcha.Next line: a character side for which wall to follow (from Pikaptcha's perspective).Game Output6*N lines of N characters each containing the transformed grid, in the same order as the faces were given in.Constraints

1 ≤ N ≤ 100

The allotted response time to output is ≤ 2s.

 

 

 

Answer rating: 100% (QA)

Parse input N intinput cube input ... View the full answer