Problem:
Score : 400 points

Problem Statement

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

Output

Print Yes if the objective is achievable, and No if it is not.

Sample Input 1

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

Sample 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

Sample Input 2

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

Sample Output 2

No

Sample Input 3

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

Sample Output 3

Yes

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

use proconio::input;
use proconio::marker::Chars;
use std::collections::HashMap;

fn main() {
    input! {
        n: usize,
        a: usize,
        b: usize,
        c: usize,
        d: usize,
        s: Chars,
    }

    let mut trade = false;
    let mut map = Vec::new();

    let mut counter = 0;
    for c in s {
        match c {
            '.' => {
                map.push(1);
                counter += 1;
                if counter == 3 {
                    trade = true;
                }
            },
            '#' => {
                map.push(0);
                counter = 0;
            },
            _ => unreachable!(),
        }
    }

    if c > d && a < b && !trade {
        // cがdより大きく飛び越えられないならば
        println!("No");
    } else if c < d && a > b && !trade {
        // cがdより大きく飛び越えられないならば
        println!("No");
    } else {
        // aが行ける範囲内にcがあるか
        if search(&map, a - 1, c - 1) && search(&map, b - 1, d - 1) {
            println!("Yes");
        } else {
            println!("No");
        }
    }
}

fn search(map: &[usize], start: usize, target: usize) -> bool {
    let mut s = Vec::new();
    let mut leached = HashMap::new();
    s.push(start);
    leached.insert(start, 0);
    while s.len() > 0 {
        let point = s.pop().unwrap();
        // 左から順番にチェックしていく
        if point > 1 && map[point - 2] != 0 && !leached.contains_key(&(point - 2)) {
            leached.insert(point - 2, 0);
            s.push(point - 2);
            if point - 2 == target {
                return true;
            }
        }
        if point > 0 && map[point - 1] != 0 && !leached.contains_key(&(point - 1)) {
            leached.insert(point - 1, 0);
            s.push(point - 1);
            if point - 1 == target {
                return true;
            }
        }
        if point < map.len() - 1 && map[point + 1] != 0 && !leached.contains_key(&(point + 1)) {
            leached.insert(point + 1, 0);
            s.push(point + 1);
            if point + 1 == target {
                return true;
            }
        }
        if point < map.len() - 2 && map[point + 2] != 0 && !leached.contains_key(&(point + 2)) {
            leached.insert(point + 2, 0);
            s.push(point + 2);
            if point + 2 == target {
                return true;
            }
        }
    }
    false
}