CROC-MBTU 2012, Final Round (Online version, Div. 2)
E
Mad Joe
Codeforces
2000
原题
← D→
翻译中…

Joe has been hurt on the Internet. Now he is storming around the house, destroying everything in his path.

翻译中…

Joe's house has $*n*$ floors, each floor is a segment of $*m*$ cells. Each cell either contains nothing (it is an empty cell), or has a brick or a concrete wall (always something one of three). It is believed that each floor is surrounded by a concrete wall on the left and on the right.

翻译中…

Now Joe is on the $*n*$-th floor and in the first cell, counting from left to right. At each moment of time, Joe has the direction of his gaze, to the right or to the left (always one direction of the two). Initially, Joe looks to the right.

翻译中…

Joe moves by a particular algorithm. Every second he makes one of the following actions:

翻译中…
  • If the cell directly under Joe is empty, then Joe falls down. That is, he moves to this cell, the gaze direction is preserved.
  • Otherwise consider the next cell in the current direction of the gaze.
  • If the cell is empty, then Joe moves into it, the gaze direction is preserved.
    • If this cell has bricks, then Joe breaks them with his forehead (the cell becomes empty), and changes the direction of his gaze to the opposite.
    • If this cell has a concrete wall, then Joe just changes the direction of his gaze to the opposite (concrete can withstand any number of forehead hits).
翻译中…

Joe calms down as soon as he reaches any cell of the first floor.

翻译中…

The figure below shows an example Joe's movements around the house.

翻译中…

image

翻译中…

Determine how many seconds Joe will need to calm down.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*m*$ ($2 ≤ *n* ≤ 100$, $1 ≤ *m* ≤ 10^{4}$).

翻译中…

Next $*n*$ lines contain the description of Joe's house. The $*i*$-th of these lines contains the description of the $(*n* - *i* + 1)$-th floor of the house — a line that consists of $*m*$ characters: "." means an empty cell, "+" means bricks and "#" means a concrete wall.

翻译中…

It is guaranteed that the first cell of the $*n*$-th floor is empty.

翻译中…

Output

翻译中…

Print a single number — the number of seconds Joe needs to reach the first floor; or else, print word "Never" (without the quotes), if it can never happen.

翻译中…

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

样例

Input #1
3 5
..+.#
#+..+
+.#+.
Output #1
14
InputCopy OutputCopy
Input #2
4 10
...+.##+.+
+#++..+++#
++.#++++..
.+##.++#.+
Output #2
42
InputCopy OutputCopy
Input #3
2 2
..
++
Output #3
Never
InputCopy OutputCopy
题目信息
题号
250E
时间限制
1 s
内存限制
256 MB
标签
暴力

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。