Submission #46767014

---

Source Code Expand

#include <bits/stdc++.h>

void solve(std::istream& is, std::ostream& os) {
    using Num = long long int;
    Num n {0};
    Num a {0};
    Num b {0};
    Num c {0};
    Num d {0};
    std::string s;
    is >> n >> a >> b >> c >> d >> s;
    --a;
    --b;
    --c;
    --d;

    if (b < a) {
        std::swap(a, b);
        std::swap(c, d);
    }

    if (c == d) {
        os << "No\n";
        return;
    }

    const std::array<std::pair<Num, Num>,2> ss {{{a, c}, {b, d}}};
    for(const auto& [start, goal] : ss) {
        Num len {0};
        for(Num i{start}; i<=goal; ++i) {
            if (s.at(i) == '.') {
                len = 0;
            } else {
                ++len;
                if (len >= 2) {
                    os << "No\n";
                    return;
                }
            }
        }
    }

    if ((a < b) && (d < c)) {
        Num max_len {0};
        Num len {0};
        for(Num i{std::max(0LL,b-1)}; i<=std::min(n-1,d+1); ++i) {
            if (s.at(i) == '#') {
                len = 0;
            } else {
                ++len;
                max_len = std::max(max_len, len);
            }
        }
        if (max_len < 3) {
            os << "No\n";
            return;
        }
    }

    os << "Yes\n";
    return;
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result