Score : 400 points
There are N squares arranged in a row, numbered 1, 2, ..., N from left to right.
You are given a string S of length N consisting of .
and #
. If the i-th character of S is #
, Square i contains a rock; if the i-th character of S is .
, Square i is empty.
In the beginning, Snuke stands on Square A, and Fnuke stands on Square B.
You can repeat the following operation any number of times:
You want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.
Determine whether this is possible.
.
and #
.Input is given from Standard Input in the following format:
N A B C D S
Print Yes
if the objective is achievable, and No
if it is not.
7 1 3 6 7 .#..#..
Yes
The objective is achievable by, for example, moving the two persons as follows. (A
and B
represent Snuke and Fnuke, respectively.)
A#B.#.. A#.B#.. .#AB#.. .#A.#B. .#.A#B. .#.A#.B .#..#AB
7 1 3 7 6 .#..#..
No
15 1 3 15 13 ...#.#...#.#...
Yes