Submission #50353182

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num h, w, n;
    is >> h >> w >> n;

    std::string t;
    is >> t;

    std::vector<std::string> grid(h);
    for(auto&& s : grid) {
        is >> s;
    }

    std::map<char, std::pair<Num, Num>> dirs {
        {'L', {0,-1}}, {'R', {0,1}}, {'U', {-1,0}}, {'D', {1,0}}};

    std::set<std::pair<Num,Num>> gs;
    for(Num init_y{1}; init_y<h; ++init_y) {
        for(Num init_x{1}; init_x<w; ++init_x) {
            bool valid = (grid.at(init_y).at(init_x) == '.');
            Num y = init_y;
            Num x = init_x;
            for(const auto& d : t) {
                const auto [dy, dx] = dirs[d];
                y += dy;
                x += dx;
                if ((y < 0) || (y >= h) || (x < 0) || (x >= w) || (grid.at(y).at(x) == '#')) {
                    valid = false;
                    break;
                }
            }

            if (valid) {
                gs.insert(std::make_pair(y, x));
            }
        }
    }

    os << gs.size() << "\n";
}

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

Submission Info

Judge Result