結果

問題 No.867 避難経路
ユーザー gazellegazelle
提出日時 2019-08-16 22:17:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 8,162 bytes
コンパイル時間 2,756 ms
コンパイル使用メモリ 220,552 KB
実行使用メモリ 184,192 KB
最終ジャッジ日時 2024-09-22 17:49:03
合計ジャッジ時間 51,184 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 142 ms
183,868 KB
testcase_01 AC 144 ms
183,816 KB
testcase_02 AC 141 ms
183,900 KB
testcase_03 AC 140 ms
183,920 KB
testcase_04 AC 141 ms
183,864 KB
testcase_05 AC 139 ms
183,904 KB
testcase_06 AC 142 ms
183,924 KB
testcase_07 AC 144 ms
183,808 KB
testcase_08 AC 142 ms
183,812 KB
testcase_09 AC 141 ms
183,900 KB
testcase_10 AC 143 ms
183,812 KB
testcase_11 AC 144 ms
183,924 KB
testcase_12 AC 142 ms
183,836 KB
testcase_13 AC 144 ms
183,880 KB
testcase_14 AC 144 ms
183,936 KB
testcase_15 AC 2,239 ms
184,004 KB
testcase_16 AC 2,025 ms
184,036 KB
testcase_17 AC 2,092 ms
184,064 KB
testcase_18 AC 2,157 ms
184,064 KB
testcase_19 AC 2,126 ms
184,064 KB
testcase_20 AC 1,993 ms
184,064 KB
testcase_21 AC 2,121 ms
184,064 KB
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
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 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:221:27: warning: narrowing conversion of '(((ll)(& a.std::vector<std::vector<int> >::operator[](((std::vector<std::vector<int> >::size_type)gx)))->std::vector<int>::operator[](((std::vector<int>::size_type)gy))) + (i * i))' from 'll' {aka 'long int'} to 'int' [-Wnarrowing]
  221 |         q.push({a[gx][gy] + i * i, {gx, gy}});

ソースコード

diff # 

#include <bits/stdc++.h>
#define FOR(i, n, m) for(ll i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-15;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}

struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }

#define MAX_N 3030303
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}

using mi = modint;
template <typename T> struct segment_tree {
private:
    int n;
    const function<T(T, T)> op;
    const T ie;
    vector<T> seq;
    
public:
    segment_tree(int _n, function<T(T, T)> op, const T ie) : op(op), ie(ie) {
        n = 1;
        while(n < _n) n *= 2;
        seq.resize(2 * n - 1);
        for(int i = 0; i < 2 * n - 1; i++) seq[i] = ie;
    }
    
    void update(int k, const T e) {
        k += n - 1;
        seq[k] = e;
        while(k > 0) {
            k = (k - 1) / 2;
            seq[k] = op(seq[k * 2 + 1], seq[k * 2 + 2]);
        }
    }
    
    T get(int k) {
        k += n - 1;
        return seq[k];
    }
    
    T query(int a, int b, int k = 0, int l = 0, int r = -1) {
        if(r == -1) r = n;
        if(r <= a || b <= l) return ie;
        if(a <= l && r <= b) return seq[k];
        T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
        T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
        return op(vl, vr);
    }
};
// segment_tree<ll> rsq(n, [] (ll a, ll b) { return a + b; }, 0)
// segment_tree<ll> rMq(n, [] (ll a, ll b) { return max(a, b); }, -1e18)
// segment_tree<ll> rmq(n, [] (ll a, ll b) { return min(a, b); }, 1e18)

int n;
void calc(int pos, vector<int>& a, segment_tree<int>& seg) {
    if(pos + 24 > n) return;
    if(pos < 0) return;
    int sum = 0;
    REP(i, 24) sum += a[pos + i];
    seg.update(pos, sum);
    return;
}
vector<vector<vector<int>>> ans1(121, vector<vector<int>>(250, vector<int>(250, inf)));
vector<vector<vector<int>>> ans2(501, vector<vector<int>>(250, vector<int>(250, -1)));
int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
int h, w;
int gx, gy;
vector<vector<int>> a;
int memo(int r, int x, int y) {
    if(x < 0 || x >= h || y < 0 || y >= w) return inf;
    if(ans2[r][x][y] != -1) return ans2[r][x][y];
    if(x == gx && y == gy) return ans2[r][x][y] = a[gx][gy];
    int ret = inf;
    if(x == gx) {
        if(r) ret = min({ret, memo(r - 1, x - 1, y), memo(r - 1, x + 1, y)});
    } else if(x > gx) {
        ret = min(ret, memo(r, x - 1, y));
        if(r) ret = min(ret, memo(r - 1, x + 1, y));
    } else {
        ret = min(ret, memo(r, x + 1, y));
        if(r) ret = min(ret, memo(r - 1, x - 1, y));
    }
    if(y == gy) {
        if(r) ret = min({ret, memo(r - 1, x, y - 1), memo(r - 1, x, y + 1)});
    } else if(y > gy) {
        ret = min(ret, memo(r, x, y - 1));
        if(r) ret = min(ret, memo(r - 1, x, y + 1));
    } else {
        ret = min(ret, memo(r, x, y + 1));
        if(r) ret = min(ret, memo(r - 1, x, y - 1));
    }
    return ans2[r][x][y] = ret + a[x][y];
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> h >> w;
    cin >> gx >> gy;
    gx--; gy--;
    a.assign(h, vector<int>(w));
    REP(i, h) REP(j, w) cin >> a[i][j];
    FOR(i, 1, 121) {
        ans1[i][gx][gy] = a[gx][gy] + i * i;
        priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> q;
        q.push({a[gx][gy] + i * i, {gx, gy}});
        while(!q.empty()) {
            int cost = q.top().first;
            pair<int, int> pos = q.top().second;
            q.pop();
            if(cost != ans1[i][pos.first][pos.second]) continue;
            REP(j, 4) {
                pair<int, int> np = {pos.first + dx[j], pos.second + dy[j]};
                if(np.first >= 0 && np.first < h && np.second >= 0 &&
                   np.second < w && ans1[i][np.first][np.second] > cost + a[np.first][np.second] + i * i) {
                    ans1[i][np.first][np.second] = cost + a[np.first][np.second] + i * i;
                    q.push({ans1[i][np.first][np.second], np});
                }
            }
        }
    }
    REP(i, 501) REP(j, h) REP(k, w) {
        memo(i, j, k);
    }
    int q;
    cin >> q;
    REP(i, q) {
        int x, y;
        ll k;
        cin >> x >> y >> k;
        x--; y--;
        if(k <= 120) {
            cout << ans1[k][x][y] << "\n";
        } else {
            ll c = abs(gx - x) + abs(gy - y) + 1;
            ll ans = inf * inf;
            REP(j, 501) {
                ans = min(ans, ans2[j][x][y] + (c + j) * k * k);
            }
            cout << ans << "\n";
        }
    }
    return 0;
}
0