結果

問題 No.867 避難経路
ユーザー jelljell
提出日時 2019-08-19 22:36:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 11,237 bytes
コンパイル時間 1,630 ms
コンパイル使用メモリ 131,768 KB
実行使用メモリ 471,320 KB
最終ジャッジ日時 2024-10-05 07:44:23
合計ジャッジ時間 15,113 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
57,984 KB
testcase_01 AC 48 ms
57,984 KB
testcase_02 AC 51 ms
58,112 KB
testcase_03 AC 48 ms
57,984 KB
testcase_04 AC 48 ms
58,240 KB
testcase_05 AC 48 ms
58,240 KB
testcase_06 AC 49 ms
57,984 KB
testcase_07 AC 49 ms
58,112 KB
testcase_08 AC 48 ms
58,112 KB
testcase_09 AC 54 ms
57,984 KB
testcase_10 AC 49 ms
58,112 KB
testcase_11 AC 58 ms
57,984 KB
testcase_12 AC 48 ms
58,240 KB
testcase_13 AC 49 ms
58,240 KB
testcase_14 AC 49 ms
58,240 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef DEBUG
    #define _GLIBCXX_DEBUG
#endif 
#if !defined(LOCAL) && !defined(DEBUG)
    #pragma GCC optimize("Ofast")
#endif
#include <cassert>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>

#define stdout_filepath "stdout.txt"
#define stderr_filepath "stderr.txt"
#define iostream_untie true
#define stdout_precision 10
#define stderr_precision 10
#define itrep(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritrep(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int_fast64_t i = 0; i < (int_fast64_t)(n); ++i)
#define rrep(i,n) for(int_fast64_t i = (int_fast64_t)(n) - 1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcountll

using namespace std;
using i64 = int_fast64_t;
using pii = pair<int, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / (T)2 - (T)1234567;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double Pi = 3.1415926535897932384626433832;
constexpr long double Golden = 1.61803398874989484820;

namespace setup {
    struct setupper {
        setupper() {
            if(iostream_untie) {
                ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
                // std::cout.tie(nullptr);
                // std::cerr.tie(nullptr);
            }
            std::cout << std::fixed << std::setprecision(stdout_precision);
            std::cerr << std::fixed << std::setprecision(stderr_precision);
    #ifdef LOCAL
            if(!freopen(stderr_filepath,"wt",stderr)) {
                freopen("CON","wt",stderr);
                std::cerr << "Failed to open the stderr file\n";
            }
            if(!freopen(stdout_filepath,"wt",stdout)) {
                freopen("CON","wt",stdout);
                std::cerr << "Failed to open the stdout file\n";
            }
            // auto print_atexit = []() {
            //     std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
            //     std::cerr << "------------\n";
            // };
            // atexit((void(*)())print_atexit);
    #endif
        }
    } __setupper;
}

namespace std {
    template <class RAitr> void rsort(RAitr __first, RAitr __last) {
        sort(__first, __last, greater<>());
    }
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>
    struct hashval_calc {
        static void apply(size_t& seed, tuple_t const& t) {
            hashval_calc<tuple_t, index - 1>::apply(seed, t);
            hash_combine(seed,get<index>(t));
        }
    };
    template <class tuple_t>
    struct hashval_calc<tuple_t, 0> {
        static void apply(size_t& seed, tuple_t const& t) {
            hash_combine(seed,get<0>(t));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& t) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,t);
            return seed;
        }
    };
}

template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> istream &operator>> (istream &s, vector<T> &v) { for(T &e : v) { s >> e; }   return s; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); ++i) { s << (i ? " " : "") << v[i]; }   return s;
}
template <class tuple_t, size_t index>
struct tupleos {
    static ostream &apply(ostream &s, const tuple_t &t) {
        tupleos<tuple_t,index - 1>::apply(s,t);
        return s << " " << get<index>(t);
    }
}; 
template <class tuple_t>
struct tupleos<tuple_t, 0> {
    static ostream &apply(ostream &s, const tuple_t &t) {
        return s << get<0>(t);
    }
};
template <class ...T> ostream &operator<< (ostream &s, const tuple<T...> &t) {
    return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s,t);
}
template <> ostream &operator<< (ostream &s, const tuple<> &t) { return s; }
#ifdef DEBUG
    #define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ", dump_func(__VA_ARGS__)
#else
    #define dump(...) 
#endif
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
template <class P> void read(P __first, P __second) {
    for(P i = __first; i != __second; ++i) cin >> *i;
}

namespace updater {
    template <class T> static void add(T &x, const T &y) { x += y; }
    template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
    template <class T> static void mul(T &x, const T &y) { x *= y; }
    template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
    template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }
    template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }
};
using updater::add;
using updater::mul;
using updater::chmax;
using updater::chmin;
template <class T> constexpr T minf(const T &x, const T &y) { return min(x,y); }
template <class T> constexpr T maxf(const T &x, const T &y) { return max(x,y); }
constexpr bool odd(int_fast64_t n) { return n & 1; }
constexpr bool even(int_fast64_t n) { return (int)odd(n) ^ 1; }
constexpr bool bit(int_fast64_t n, int e) { return (n >> e) & 1; }
constexpr int_fast64_t mask(int_fast64_t n, int e) { return n & ((1 << e) - 1); }
constexpr int_fast64_t ilog(int_fast64_t x, int_fast64_t b = 2) { return x ? 1 + ilog(x / b, b) : -1; }
constexpr int_fast64_t gcd(int_fast64_t x, int_fast64_t y) { return x = max(x, -x), y = max(y, -y) ? gcd(y, x % y) : x; }
constexpr int_fast64_t lcm(int_fast64_t x, int_fast64_t y) { return x ? x / gcd(x, y) * y : 0; }
int_fast64_t binry(int_fast64_t ok, int_fast64_t ng, const function<bool(int_fast64_t)> &fn) {
    while (abs(ok - ng) > 1) {
        int_fast64_t mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array, (T*)(array + N), val); }
template <class T> vector<int> cmprs(const vector<T> &v) {
    vector<T> tmp = v; vector<int> ret;
    sort(begin(tmp),end(tmp));
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(T i : v) ret.emplace_back(lower_bound(begin(tmp),end(tmp),i) - begin(tmp));
    return ret;
}
template <class T> vector<int> cmprs(const T *__first, const T *__last) {
    return cmprs(vector<T>(__first, __last));
}
void for_subset(int_fast64_t s, const function<void(int_fast64_t)> &fn) {
    int_fast64_t tmp = s;
    do { fn(tmp); } while((--tmp &= s) != s);
}


/* The main code follows. */


signed main() {
    void solve();
    void input();
    void init();

    int t = 1;

    #ifdef LOCAL
        // cin >> t;
    #endif

    // cin >> t;
    
    while(t--) {
        input();
        init();
        solve();
    }
}


int h,w;
int gx,gy;
int ar[256][256];

void input() {
    cin>>h>>w>>gx>>gy;
    gx--,gy--;
    for(int i=0; i<h; ++i) read(ar[i],ar[i]+w);
}



void init() {}

i64 dist[2500][250][250];
i64 ndist[250][250];

void solve() {
    bool outrng(int x,int y);
    bool inrng(int x,int y);

    for(int k=1; k<2500; ++k) {
        int a[256][256];
        auto now=dist[k];
        for(int i=0; i<h; ++i) {
            for(int j=0; j<w; ++j) {
                a[i][j]=ar[i][j]+k*k;
                now[i][j]=inf<i64>;
            }
        }
        minheap<pair<i64,pii>> que;
        que.emplace(now[gx][gy]=a[gx][gy],pii(gx,gy));
        while(!que.empty()) {
            i64 d; int x,y; 
            auto vrp=que.top();
            d=vrp.fir;
            tie(x,y)=vrp.sec;
            que.pop();
            if(now[x][y]<d) continue;
            for(int i=0; i<4; ++i) {
                int nx=dx[i]+x;
                int ny=dy[i]+y;
                if(outrng(nx,ny)) continue;
                if(chmin(now[nx][ny],d+a[nx][ny])) {
                    que.emplace(now[nx][ny],pii(nx,ny));
                }
            }
        }
    }

    init(ndist,inf<i64>);
    minheap<pair<i64,pii>> que;
    que.emplace(ndist[gx][gy]=ar[gx][gy],pii(gx,gy));
    while(!que.empty()) {
        i64 d; int x,y;
        d=que.top().fir;
        tie(x,y)=que.top().sec;
        que.pop();
        dump(x,y,d);
        if(ndist[x][y]<d) continue;
        int nx,ny;
        if(x>=gx) {
            nx=x+1;
            ny=y;
            if(inrng(nx,ny) and chmin(ndist[nx][ny],d+ar[nx][ny])) que.emplace(ndist[nx][ny],pii(nx,ny));
        }
        if(x<=gx) {
            nx=x-1;
            ny=y;
            if(inrng(nx,ny) and chmin(ndist[nx][ny],d+ar[nx][ny])) que.emplace(ndist[nx][ny],pii(nx,ny));
        }
        if(y<=gy) {
            nx=x;
            ny=y-1;
            if(inrng(nx,ny) and chmin(ndist[nx][ny],d+ar[nx][ny])) que.emplace(ndist[nx][ny],pii(nx,ny));
        }
        if(y>=gy) {
            nx=x;
            ny=y+1;
            if(inrng(nx,ny) and chmin(ndist[nx][ny],d+ar[nx][ny])) que.emplace(ndist[nx][ny],pii(nx,ny));
        }
    }

    int qry; cin>>qry;
    while(qry--) {
        int x,y; i64 k; cin>>x>>y>>k;
        x--,y--;
        if(k<2500) {
            write(dist[k][x][y]);
        } else {
            i64 manh=abs(x-gx)+abs(y-gy)+2;
            dump(ndist[x][y]);
            write(manh*k*k+ndist[x][y]);
        }
    }
}

bool outrng(int x,int y) {
    return x<0 || y<0 || x>=h || y>=w;
}

bool inrng(int x,int y) {
    return !outrng(x,y);
}
0