메모리: 37176 KB, 시간: 724 ms
구현, 시뮬레이션
2024년 9월 5일 11:31:13
Farmer John is quite reliable in all aspects of managing his farm, except one: he is terrible at mowing the grass in a timely or logical fashion.
The farm is a large 2D grid of square unit cells. FJ starts in one of these cells at time t=0\(t = 0\), mowing the grass in this cell so that it is initially the only cell in which the grass is cut. FJ's remaining mowing pattern is described by a sequence of N\(N\) statements. For example, if the first statement is "W 10", then for times t=1\(t = 1\) through t=10\(t = 10\) (i.e., the next 10 units of time), FJ will step one cell to his west, mowing the grass along the way. After completing this sequence of steps, he will end up 10 cells to his west at time t=10\(t = 10\), having mowed the grass in every cell along the way.
So slow is FJ's progress that some of the grass he mows might grow back before he is finished with all his mowing. Any section of grass that is cut at time t\(t\) will reappear at time t+x\(t + x\).
FJ's mowing pattern might have him re-visit the same cell multiple times, but he remarks that he never encounters a cell in which the grass is already cut. That is, every time he visits a cell, his most recent visit to that same cell must have been at least x\(x\) units of time earlier, in order for the grass to have grown back.
Please determine the maximum possible value of x\(x\) so that FJ's observation remains valid.
The first line of input contains N\(N\) (1≤N≤100\(1 \leq N \leq 100\)). Each of the remaining N\(N\) lines contains a single statement and is of the form 'D S', where D is a character describing a direction (N=north, E=east, S=south, W=west) and S is the number of steps taken in that direction (1≤S≤10\(1 \leq S \leq 10\)).
Please determine the maximum value of x\(x\) such that FJ never steps on a cell with cut grass. If FJ never visits any cell more than once, please output -1.