結果
問題 | No.867 避難経路 |
ユーザー | gazelle |
提出日時 | 2019-08-16 22:31:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4,076 ms / 6,000 ms |
コード長 | 6,734 bytes |
コンパイル時間 | 3,298 ms |
コンパイル使用メモリ | 211,468 KB |
実行使用メモリ | 137,692 KB |
最終ジャッジ日時 | 2024-09-22 18:42:42 |
合計ジャッジ時間 | 79,333 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 102 ms
137,344 KB |
testcase_01 | AC | 103 ms
137,140 KB |
testcase_02 | AC | 100 ms
137,408 KB |
testcase_03 | AC | 102 ms
137,164 KB |
testcase_04 | AC | 98 ms
137,220 KB |
testcase_05 | AC | 98 ms
137,324 KB |
testcase_06 | AC | 96 ms
137,332 KB |
testcase_07 | AC | 99 ms
137,216 KB |
testcase_08 | AC | 96 ms
137,232 KB |
testcase_09 | AC | 103 ms
137,232 KB |
testcase_10 | AC | 97 ms
137,236 KB |
testcase_11 | AC | 99 ms
137,340 KB |
testcase_12 | AC | 99 ms
137,216 KB |
testcase_13 | AC | 95 ms
137,344 KB |
testcase_14 | AC | 99 ms
137,216 KB |
testcase_15 | AC | 2,157 ms
137,692 KB |
testcase_16 | AC | 2,121 ms
137,600 KB |
testcase_17 | AC | 2,181 ms
137,512 KB |
testcase_18 | AC | 2,053 ms
137,600 KB |
testcase_19 | AC | 2,017 ms
137,344 KB |
testcase_20 | AC | 1,976 ms
137,600 KB |
testcase_21 | AC | 1,987 ms
137,600 KB |
testcase_22 | AC | 3,184 ms
137,344 KB |
testcase_23 | AC | 3,306 ms
137,600 KB |
testcase_24 | AC | 3,068 ms
137,472 KB |
testcase_25 | AC | 4,011 ms
137,472 KB |
testcase_26 | AC | 3,939 ms
137,600 KB |
testcase_27 | AC | 4,007 ms
137,600 KB |
testcase_28 | AC | 4,022 ms
137,472 KB |
testcase_29 | AC | 4,076 ms
137,472 KB |
testcase_30 | AC | 1,851 ms
137,472 KB |
testcase_31 | AC | 1,880 ms
137,472 KB |
testcase_32 | AC | 1,861 ms
137,600 KB |
testcase_33 | AC | 1,847 ms
137,472 KB |
testcase_34 | AC | 1,879 ms
137,344 KB |
testcase_35 | AC | 1,963 ms
137,344 KB |
testcase_36 | AC | 1,963 ms
137,472 KB |
testcase_37 | AC | 1,906 ms
137,472 KB |
testcase_38 | AC | 1,838 ms
137,472 KB |
testcase_39 | AC | 1,834 ms
137,600 KB |
testcase_40 | AC | 1,893 ms
137,600 KB |
testcase_41 | AC | 103 ms
137,216 KB |
testcase_42 | AC | 104 ms
137,344 KB |
testcase_43 | AC | 103 ms
137,216 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:172:27: warning: narrowing conversion of '(((ll)a[gx][gy]) + (i * i))' from 'll' {aka 'long int'} to 'int' [-Wnarrowing] 172 | q.push({a[gx][gy] + i * i, {gx, gy}}); | ~~~~~~~~~~^~~~~~~
ソースコード
#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; int ans1[201][250][250]; int ans2[251][250][250]; int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}; int h, w; int gx, gy; int a[250][250]; 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); REP(i, 201) REP(j, 250) REP(k, 250) ans1[i][j][k] = inf; REP(i, 251) REP(j, 250) REP(k, 250) ans2[i][j][k] = -1; cin >> h >> w; cin >> gx >> gy; gx--; gy--; REP(i, h) REP(j, w) cin >> a[i][j]; FOR(i, 1, 201) { 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, 251) 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 <= 200) { cout << ans1[k][x][y] << "\n"; } else { ll c = abs(gx - x) + abs(gy - y) + 1; ll ans = inf * inf; REP(j, 251) { ans = min(ans, ans2[j][x][y] + (c + j) * k * k); } cout << ans << "\n"; } } return 0; }