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 Kotlin (1.0.0) (judge verdict: Wrong Answer)

import java.util.*

fun main(args: Array<String>) {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val a = sc.nextInt()
    val b = sc.nextInt()
    val c = sc.nextInt()
    val d = sc.nextInt()
    val s = sc.next()
    println(problem034a(n, a, b, c, d, s))
}

fun problem034a(n: Int, a: Int, b: Int, c: Int, d: Int, s: String): String {
    val min = listOf(a, b, c, d).min()!!
    val max = listOf(a, b, c, d).max()!!
    var sunuke = a
    var funuke = b
    var isSunukeMoved = true
    var isFunukeMoved = true
    var start = 0
    var end = 0
    var canReplace = false
    for (i in 3 until n) {
        if (s[i] == '#' && s[i - 1] == '#') {
            end = i - 3
//            debugLog(start, end)
//            debugLog(min..max)
            if (start in min..max && end in min..max) {
//                debugLog("Yes")
                canReplace = true
                break
            }
            start = i + 1
        }
        if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
            start = i - 1
        }
    }
    if (!canReplace) {
        end = n
//        debugLog(start, end)
        if (start in min..max && end in min..max) {
            canReplace = true
        }
    }
//    debugLog(canReplace)
    loop@ while (isSunukeMoved || isFunukeMoved) {
        if (sunuke == c && funuke == d) {
            return "Yes"
        }
        when {
            sunuke > c -> {
                if (sunuke - 1 == c && (canReplace || sunuke - 1 != funuke)) {
                    sunuke--
                    isSunukeMoved = true
                    continue@loop
                }
                if ((canReplace || sunuke - 2 != funuke) && s[sunuke - 1 - 2] != '#') {
                    sunuke -= 2
                    isSunukeMoved = true
                    continue@loop
                }
                if ((canReplace || sunuke - 1 != funuke) && s[sunuke - 1 - 2] != '#') {
                    sunuke--
                    isSunukeMoved = true
                    continue@loop
                }
            }
            sunuke < c -> {
                if (sunuke + 1 == c && (canReplace || sunuke + 1 != funuke)) {
                    sunuke++
                    isSunukeMoved = true
                    continue@loop
                }
                if ((canReplace || sunuke + 2 != funuke) && s[sunuke - 1 + 2] != '#') {
                    sunuke += 2
                    isSunukeMoved = true
                    continue@loop
                }
                if ((canReplace || sunuke + 1 != funuke) && s[sunuke - 1 + 1] != '#') {
                    sunuke++
                    isSunukeMoved = true
                    continue@loop
                }
            }
            sunuke == c -> {
                isSunukeMoved = false
            }
        }
        when {
            funuke > d -> {
                if (funuke - 1 == d && (canReplace || funuke - 1 != sunuke)) {
                    funuke--
                    isFunukeMoved = true
                    continue@loop
                }
                if ((canReplace || funuke - 2 != sunuke) && s[funuke - 1 - 2] != '#') {
                    funuke -= 2
                    isFunukeMoved = true
                    continue@loop
                }
                if ((canReplace || funuke - 1 != sunuke) && s[funuke - 1 - 2] != '#') {
                    funuke--
                    isFunukeMoved = true
                    continue@loop
                }
            }
            funuke < d -> {
                if (funuke + 1 == d && (canReplace || funuke + 1 != sunuke)) {
                    funuke++
                    isFunukeMoved = true
                    continue@loop
                }
                if ((canReplace || funuke + 2 != sunuke) && s[funuke - 1 + 2] != '#') {
                    funuke += 2
                    isFunukeMoved = true
                    continue@loop
                }
                if ((canReplace || funuke + 1 != sunuke) && s[funuke - 1 + 1] != '#') {
                    funuke++
                    isFunukeMoved = true
                    continue@loop
                }
            }
        }
        isFunukeMoved = false
        isSunukeMoved = false
    }
    return "No"
}