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.15.1) (judge verdict: Accepted)

use std::str::FromStr;
use std::fmt::Debug;
use std::cmp;

#[allow(dead_code)]
fn read_as_vec<T>() -> Vec<T>
where T: FromStr, <T as FromStr>::Err : Debug{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().split_whitespace().map(|c| T::from_str(c).unwrap()).collect()

}

#[allow(dead_code)]
fn read_as_string() -> String{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn is_reachable(trout: &[char], initial: usize, goal: usize) -> bool{
    let mut current = initial;

    loop{
        //println!("{}, {}",current, goal);
        if current == goal{
            return true;
        }
        if current+2< trout.len() && trout[current+2] == '.' && current+1 != goal{
            current += 2;
        }else if trout[current+1] == '.'{
            current += 1;
        }else{
            return false;
        }
    }

}

fn is_reachable2(trout: &[char], initial: usize, goal: usize) -> (bool, bool){
    //return (bool, bool)
    //left is true if is reachable.
    //right is true if another can go over passed man.
    let mut current = initial;
    let mut can_go_over = false;

    loop{
        //println!("{}, {}",current, goal);
        if trout[current-1] == '.' && trout[current+1] == '.'{
            can_go_over = true;
        }
        
        if current == goal{
            return (true, can_go_over);
        }
        
        if trout[current+1] == '.'{
            current += 1;
        }else if trout[current+2] == '.'{
            current += 2;

        }else{
            return (false, can_go_over);
        }
        /*
        if current+2< trout.len() && trout[current+2] == '.' && current+1 != goal{
            current += 2;
        }else if trout[current+1] == '.'{
            current += 1;
        }else{
            return false;
        }
        */
    }
}
fn main(){
    let line: Vec<usize> = read_as_vec();
    let (n, mut a, mut b, mut c, mut d) = (line[0], line[1]-1, line[2]-1, line[3]-1, line[4]-1);
    let mut trout: Vec<char> = read_as_string().chars().collect::<Vec<char>>();
    //situations
    //there are 3 patterns
    //if "a c b d", move sunuke first
    //if "a b c d", consider it as "b a d c" and move sunuke first.
    //if "a b d c", consider it as "b a c d" and move sunuke first.
    //println!("{}, {}, {}, {}", a, b, c, d);
    if (a < b && b < c && c < d) || (a < b && b < d && d < c){

        let tmp_a = a;
        a = b;
        b = tmp_a;
        let tmp_c = c;
        c = d;
        d = tmp_c;
    }
    //println!("{}, {}, {}, {}", a, b, c, d);

    //if "a c b d", move sunuke first
    //if "a b c d", consider it as "b a d c" and move sunuke first.
    if (a < c && c < b && b < d) || (b < a && a < d && d < c){
        //println!("sitution 1 or 3");
        if is_reachable(&trout, a, c) && is_reachable(&trout, b, d){
            println!("Yes");
        }else{
            println!("No");
        }
    }else if b < a && a < c && c < d{
        //println!("sitution 2");
        //if "b a c d", solving way is complicated
        let res = is_reachable2(&trout, a, c);
        //println!("{:?}", res);
        if res.0 && res.1 && is_reachable(&trout, b, d){
            println!("Yes");
        }else{
            println!("No");
        }
    }else{
        println!("error");
    }
}