Submission #70058202

---

Source Code Expand

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define Endl endl
#define all(a) a.begin(), a.end()
#define pr(i, j) make_pair(i, j)
#define isin(x, l, r) (l <= x && x < r)
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define srt(ar) sort(ar.begin(), ar.end())
#define rev(ar) reverse(ar.begin(), ar.end())
#define jge(f, s, t) cout << (f ? s : t) << endl
template <typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define printar(ar)             \
    do                          \
    {                           \
        for (auto dbg : ar)     \
        {                       \
            cout << dbg << " "; \
        }                       \
        cout << endl;           \
    } while (0)
const ll inf = 1e18;
const ld pi = 3.14159265358979;
const ld eps = 1e-9;
template <class T, ll n, ll idx = 0>
auto make_vec(const ll (&d)[n], const T &init) noexcept
{
    if constexpr (idx < n)
        return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));
    else
        return init;
}

template <class T, ll n>
auto make_vec(const ll (&d)[n]) noexcept
{
    return make_vec(d, T{});
}
template <class T>
size_t HashCombine(const size_t seed, const T &v)
{
    return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
}
/* pair用 */
template <class T, class S>
struct std::hash<std::pair<T, S>>
{
    size_t operator()(const std::pair<T, S> &keyval) const noexcept
    {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template <class T>
struct std::hash<std::vector<T>>
{
    size_t operator()(const std::vector<T> &keyval) const noexcept
    {
        size_t s = 0;
        for (auto &&v : keyval)
            s = HashCombine(s, v);
        return s;
    }
};
/* tuple用 */
template <int N>
struct HashTupleCore
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept
    {
        size_t s = HashTupleCore<N - 1>()(keyval);
        return HashCombine(s, std::get<N - 1>(keyval));
    }
};
template <>
struct HashTupleCore<0>
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept { return 0; }
};
template <class... Args>
struct std::hash<std::tuple<Args...>>
{
    size_t operator()(const tuple<Args...> &keyval) const noexcept
    {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll h, w;
    cin >> h >> w;
    vector<string> s(h);
    ll X = 0, Y = 0;
    rep(i, 0, h)
    {
        cin >> s[i];
    }
    vector<vector<char>> s2(40, vector<char>(40, 'G'));
    rep(i, 0, h)
    {
        rep(j, 0, w)
        {
            if (s[i][j] == 'T')
            {
                X = i;
                Y = j;
            }
            s2[i + 15][j + 15] = s[i][j];
        }
    }
    rep(i, 0, h)
    {
        rep(j, 0, w)
        {
            if (s[i][j] == '#')
            {
                rep(k, -h + i + 1, i + 1)
                {
                    rep(l, -w + j + 1, j + 1)
                    {
                        if (s2[X + k + 15][Y + l + 15] == 'G')
                        {
                            s2[X + k + 15][Y + l + 15] = '.';
                        }
                    }
                }
            }
        }
    }
    vector<vector<ll>> d(40, vector<ll>(40, inf));
    d[X + 15][Y + 15] = 0;
    ll ans = inf;
    queue<pair<ll, ll>> que;
    que.push(pr(X + 15, Y + 15));
    vector<ll> dx = {1, 0, -1, 0};
    vector<ll> dy = {0, -1, 0, 1};
    while (!que.empty())
    {
        ll x = que.front().first;
        ll y = que.front().second;
        que.pop();
        rep(i, 0, 4)
        {
            ll nx = x + dx[i];
            ll ny = y + dy[i];
            if (isin(nx, 0, 40) && isin(ny, 0, 40))
            {
                if (s2[nx][ny] != '#')
                {
                    if (d[nx][ny] > d[x][y] + 1)
                    {
                        d[nx][ny] = d[x][y] + 1;
                        que.push(pr(nx, ny));
                    }
                }
            }
        }
    }
    rep(i, 0, 40)
    {
        rep(j, 0, 40)
        {
            if (s2[i][j] == 'G')
            {
                chmin(ans, d[i][j]);
            }
        }
    }
    if (ans == inf)
    {
        cout << -1 << Endl;
    }
    else
    {
        cout << ans << Endl;
    }
}

Submission Info

Judge Result