Kenken Race

AtCoder

IDagc034_a

Time2000ms

Memory256MB

Difficulty—

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: * Choose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person. 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. ## Constraints * $4 \leq N \leq 200\ 000$ * $S$ is a string of length $N$ consisting of `.` and `#`. * $1 \leq A, B, C, D \leq N$ * Square $A$, $B$, $C$ and $D$ do not contain a rock. * $A$, $B$, $C$ and $D$ are all different. * $A < B$ * $A < C$ * $B < D$ ## Input Input is given from Standard Input in the following format: $N$ $A$ $B$ $C$ $D$ $S$ [samples]

Samples

Input #1

7 1 3 6 7
.#..#..

Output #1

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

Input #2

7 1 3 7 6
.#..#..

Output #2

No

Input #3

15 1 3 15 13
...#.#...#.#...

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Kenken Race",
    "description": {
      "content": "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 ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc034_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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 ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments