結果

問題 No.1572 XI
ユーザー iiljjiiljj
提出日時 2021-06-27 14:04:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 403 ms / 2,000 ms
コード長 11,071 bytes
コンパイル時間 1,644 ms
コンパイル使用メモリ 146,792 KB
実行使用メモリ 27,948 KB
最終ジャッジ日時 2023-09-07 17:43:36
合計ジャッジ時間 10,753 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 84 ms
8,244 KB
testcase_05 AC 191 ms
14,888 KB
testcase_06 AC 231 ms
17,476 KB
testcase_07 AC 7 ms
4,376 KB
testcase_08 AC 196 ms
15,440 KB
testcase_09 AC 91 ms
8,768 KB
testcase_10 AC 154 ms
12,628 KB
testcase_11 AC 14 ms
4,376 KB
testcase_12 AC 68 ms
7,200 KB
testcase_13 AC 16 ms
4,380 KB
testcase_14 AC 71 ms
7,464 KB
testcase_15 AC 17 ms
4,380 KB
testcase_16 AC 56 ms
6,692 KB
testcase_17 AC 6 ms
4,380 KB
testcase_18 AC 84 ms
8,244 KB
testcase_19 AC 206 ms
15,916 KB
testcase_20 AC 132 ms
11,296 KB
testcase_21 AC 243 ms
17,948 KB
testcase_22 AC 187 ms
14,624 KB
testcase_23 AC 5 ms
4,384 KB
testcase_24 AC 2 ms
4,384 KB
testcase_25 AC 1 ms
4,380 KB
testcase_26 AC 2 ms
4,384 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 2 ms
4,384 KB
testcase_29 AC 1 ms
4,380 KB
testcase_30 AC 1 ms
4,380 KB
testcase_31 AC 2 ms
4,380 KB
testcase_32 AC 1 ms
4,376 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 358 ms
25,320 KB
testcase_35 AC 358 ms
25,292 KB
testcase_36 AC 367 ms
25,924 KB
testcase_37 AC 378 ms
26,652 KB
testcase_38 AC 372 ms
26,152 KB
testcase_39 AC 377 ms
26,404 KB
testcase_40 AC 353 ms
24,968 KB
testcase_41 AC 369 ms
25,600 KB
testcase_42 AC 373 ms
25,876 KB
testcase_43 AC 364 ms
25,584 KB
testcase_44 AC 398 ms
27,948 KB
testcase_45 AC 403 ms
27,772 KB
testcase_46 AC 396 ms
27,784 KB
testcase_47 AC 12 ms
27,696 KB
testcase_48 AC 391 ms
27,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region BFS01 */

/**
 * @param N ノード数
 * @param delta 隣接行列を生成する関数．delta(Node v, fn(Node t)).
 *              fn は現在の頂点 current と隣接する頂点を探索する関数．
 * @param index 頂点→頂点インデックス，のマップ関数．（index(Node v) -> int）
 * @return 距離テーブル
 */
template <class Node, class Delta, class Index>
vc<int> bfs_01(const int N, const vc<Node> starts, const Delta delta, const Index index) {
    vc<int> dist(N, IINF); // 距離テーブル
    deque<Node> deq;       // 「訪問予定」頂点リスト
    for (const auto &start : starts) {
        dist[index(start)] = 0; // 初期条件 (頂点 idx1 を初期頂点とする)
        deq.push_back(start);
    }
    // BFS 開始 (キューが空になるまで探索を行う)
    while (!deq.empty()) {
        Node current = deq.front();
        deq.pop_front();
        // 隣接ノードに関するループは外に出す
        delta(current, [&](const Node dst, const int cost) -> void {
            assert(cost == 0 || cost == 1);
            ll nxt_dist = dist[index(current)];
            if (cost) nxt_dist += 1;
            if (nxt_dist >= dist[index(dst)]) return;
            dist[index(dst)] = nxt_dist;
            if (cost)
                deq.push_back(dst);
            else
                deq.push_front(dst);
        });
    }
    return dist;
}

/* #endregion */

// Problem
void solve() {
    VAR(int, h, w); //
    VAR(int, sy, sx);
    VAR(int, gy, gx);
    --sx, --sy, --gy, --gx;
    vc<string> a(h);
    cin >> a;

    using Node = array<int, 3>; // (y, x, pos)
    // 右，上，左，下
    constexpr static array<int, 4> dx{1, 0, -1, 0};
    constexpr static array<int, 4> dy{0, -1, 0, 1};
    // 0上，1右，2下，3左，4手前，5背面
    constexpr static array<array<int, 4>, 6> nposlist{
        array<int, 4>{1, 5, 3, 4}, // 上から
        array<int, 4>{2, 1, 0, 1}, // 右から
        array<int, 4>{3, 4, 1, 5}, // 下から
        array<int, 4>{0, 3, 2, 3}, // 左から
        array<int, 4>{4, 0, 4, 2}, // 手前から
        array<int, 4>{5, 2, 5, 0}  // 背面から
    };
    // 隣接行列生成関数
    auto delta = [&](const Node current, function<void(Node, int)> transit) -> void {
        auto [cy, cx, cpos] = current;
        // 隣接ノードに関するループ
        TREP(int, dir, 0, 4) {
            int ny = cy + dy[dir];
            int nx = cx + dx[dir];
            if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
            if (a[ny][nx] == '#') continue;
            transit(Node{ny, nx, nposlist[cpos][dir]}, 1);
        }
    };
    // インデックス生成関数
    auto index = [&](const Node v) -> int {
        auto [cy, cx, cpos] = v; //
        return (w * cy + cx) * 6 + cpos;
    };

    Node start = {sy, sx, 0};
    vc<int> dist = bfs_01(6 * h * w, vc<Node>{start}, delta, index);

    Node goal = {gy, gx, 0};
    int gi = index(goal);
    // dump(dist);
    pprint(dist[gi] == IINF ? -1 : dist[gi]);
}

// entry point
int main() {
    solve();
    return 0;
}
0