Submission #18324412


Source Code Expand

Copy
// May this submission get accepted
#include <bits/stdc++.h>

// エイリアス
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
using namespace std;

// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif

// エイリアス (補完・コンパイルが重くなる)
// #include <boost/multiprecision/cpp_int.hpp>
// using mll = boost::multiprecision::cpp_int;

// 汎用マクロ
#define ALLOF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define FOREACH(i,q) for (auto &i : q)
template<typename T, typename U> bool chmax(T &a, const U b) { if (a < b) {a = b; return true;} return false; }
template<typename T, typename U> bool chmin(T &a, const U b) { if (a > b) {a = b; return true;} return false; }
constexpr int INF = numeric_limits<int>::max();
constexpr long long LINF = numeric_limits<long long>::max();
constexpr long double EPS = 1e-10L;
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define IIF(q,t,f) ((q) ? (t) : (f))
#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)
template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }
template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }
template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }
template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }
template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }
template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}
template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }
template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// 標準入出力
struct qin { // query input
    size_t sz;
    qin(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
qin in1; // input one
template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }
void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }
template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }
template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }

// モジュール
// [[LIBRARY]]
// [[/LIBRARY]]

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    ll h, w; cin >> h >> w;
    vector<string> a = qin(h);

    pair<ll, ll> s, g;
    map<char, set<pair<ll, ll>>> tm;

    REP(i, h) REP(j, w) {
        switch (a[i][j]) {
            case 'S':
                s = {i, j};
                break;
            case 'G':
                g = {i, j};
                break;
            case '.':
                break;
            case '#':
                break;
            default:
                tm[a[i][j]].emplace(i, j);
        }
    }

    auto neighbor = [&](ll i, ll j) {
        vector<pair<ll, ll>> r;
        if (i-1 >= 0 && a[i-1][j] != '#') {
            r.emplace_back(i-1, j);
        }
        if (j-1 >= 0 && a[i][j-1] != '#') {
            r.emplace_back(i, j-1);
        }
        if (i+1 < h && a[i+1][j] != '#') {
            r.emplace_back(i+1, j);
        }
        if (j+1 < w && a[i][j+1] != '#') {
            r.emplace_back(i, j+1);
        }
        if ('a' <= a[i][j] && a[i][j] <= 'z') {
            copy(ALLOF(tm[a[i][j]]), back_inserter(r));
        }
        return r;
    };

    vector vst(h, vector(w, -1LL));
    deque<pair<ll, ll>> q;
    q.push_back(s);
    vst[s.first][s.second] = 0;
    while (q.size()) {
        auto [i, j] = q.front(); q.pop_front();
        for (auto [u, v] : neighbor(i, j)) {
            if (vst[u][v] == -1) {
                q.emplace_back(u, v);
                vst[u][v] = vst[i][j] + 1;
                if ('a' <= a[u][v] && a[u][v] <= 'z') {
                    tm[a[u][v]].erase(pair(u, v));
                }
            }
        }
    }
    say(vst[g.first][g.second]);
    
}

Submission Info

Submission Time
Task E - Third Avenue
User ganmodokix
Language C++ (GCC 9.2.1)
Score 500
Code Size 5900 Byte
Status AC
Exec Time 503 ms
Memory 46216 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hand_01.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, random_29.txt, random_30.txt, random_31.txt, random_32.txt, random_33.txt, random_34.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
hand_01.txt AC 8 ms 3584 KB
random_01.txt AC 2 ms 3484 KB
random_02.txt AC 2 ms 3532 KB
random_03.txt AC 2 ms 3520 KB
random_04.txt AC 2 ms 3612 KB
random_05.txt AC 3 ms 3616 KB
random_06.txt AC 2 ms 3500 KB
random_07.txt AC 2 ms 3516 KB
random_08.txt AC 3 ms 3548 KB
random_09.txt AC 2 ms 3540 KB
random_10.txt AC 2 ms 3480 KB
random_11.txt AC 2 ms 3540 KB
random_12.txt AC 2 ms 3520 KB
random_13.txt AC 2 ms 3508 KB
random_14.txt AC 5 ms 3560 KB
random_15.txt AC 2 ms 3528 KB
random_16.txt AC 22 ms 6072 KB
random_17.txt AC 145 ms 22868 KB
random_18.txt AC 106 ms 13564 KB
random_19.txt AC 27 ms 5288 KB
random_20.txt AC 171 ms 23092 KB
random_21.txt AC 10 ms 3860 KB
random_22.txt AC 12 ms 4104 KB
random_23.txt AC 139 ms 22300 KB
random_24.txt AC 200 ms 29380 KB
random_25.txt AC 33 ms 6244 KB
random_26.txt AC 4 ms 3652 KB
random_27.txt AC 127 ms 16428 KB
random_28.txt AC 11 ms 4048 KB
random_29.txt AC 4 ms 3772 KB
random_30.txt AC 196 ms 28540 KB
random_31.txt AC 503 ms 43048 KB
random_32.txt AC 493 ms 46216 KB
random_33.txt AC 377 ms 39160 KB
random_34.txt AC 134 ms 38792 KB
sample_01.txt AC 3 ms 3520 KB
sample_02.txt AC 2 ms 3552 KB
sample_03.txt AC 2 ms 3496 KB