結果
問題 | No.867 避難経路 |
ユーザー | e869120 |
提出日時 | 2019-08-15 12:22:07 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,299 ms / 6,000 ms |
コード長 | 3,039 bytes |
コンパイル時間 | 966 ms |
コンパイル使用メモリ | 87,800 KB |
実行使用メモリ | 139,348 KB |
最終ジャッジ日時 | 2024-04-08 23:49:15 |
合計ジャッジ時間 | 65,796 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
136,824 KB |
testcase_01 | AC | 26 ms
135,036 KB |
testcase_02 | AC | 26 ms
135,032 KB |
testcase_03 | AC | 26 ms
137,056 KB |
testcase_04 | AC | 26 ms
134,904 KB |
testcase_05 | AC | 27 ms
135,032 KB |
testcase_06 | AC | 26 ms
134,904 KB |
testcase_07 | AC | 26 ms
134,904 KB |
testcase_08 | AC | 27 ms
136,956 KB |
testcase_09 | AC | 26 ms
134,908 KB |
testcase_10 | AC | 27 ms
136,800 KB |
testcase_11 | AC | 26 ms
135,028 KB |
testcase_12 | AC | 26 ms
136,956 KB |
testcase_13 | AC | 27 ms
136,932 KB |
testcase_14 | AC | 26 ms
136,800 KB |
testcase_15 | AC | 2,212 ms
139,348 KB |
testcase_16 | AC | 2,132 ms
138,212 KB |
testcase_17 | AC | 2,293 ms
137,576 KB |
testcase_18 | AC | 2,137 ms
138,464 KB |
testcase_19 | AC | 2,143 ms
138,504 KB |
testcase_20 | AC | 2,095 ms
137,568 KB |
testcase_21 | AC | 2,090 ms
138,436 KB |
testcase_22 | AC | 2,151 ms
138,212 KB |
testcase_23 | AC | 2,251 ms
138,624 KB |
testcase_24 | AC | 2,113 ms
138,724 KB |
testcase_25 | AC | 2,130 ms
138,700 KB |
testcase_26 | AC | 2,146 ms
137,576 KB |
testcase_27 | AC | 2,177 ms
138,484 KB |
testcase_28 | AC | 2,162 ms
138,384 KB |
testcase_29 | AC | 2,299 ms
138,840 KB |
testcase_30 | AC | 1,723 ms
138,968 KB |
testcase_31 | AC | 1,792 ms
138,616 KB |
testcase_32 | AC | 1,789 ms
138,388 KB |
testcase_33 | AC | 1,765 ms
138,460 KB |
testcase_34 | AC | 1,788 ms
138,844 KB |
testcase_35 | AC | 1,986 ms
138,540 KB |
testcase_36 | AC | 1,966 ms
138,708 KB |
testcase_37 | AC | 1,805 ms
138,456 KB |
testcase_38 | AC | 1,790 ms
138,324 KB |
testcase_39 | AC | 1,779 ms
138,496 KB |
testcase_40 | AC | 1,773 ms
138,652 KB |
testcase_41 | AC | 25 ms
136,792 KB |
testcase_42 | AC | 26 ms
134,892 KB |
testcase_43 | AC | 26 ms
137,056 KB |
ソースコード
#include <iostream> #include <queue> #include <vector> #include <algorithm> #include <functional> using namespace std; #pragma warning (disable: 4996) long long H, W, Q, gx, gy, A[259][259]; long long val[259][259][259], dist[259][259], dist2[259][259], P[259][259]; priority_queue<tuple<long long, int, int>, vector<tuple<long long, int, int>>, greater<tuple<long long, int, int>>> Que; void dijkstra(long long r) { for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) dist[i][j] = (1LL << 62); } dist[gx][gy] = 1LL * (r*r + A[gx][gy]); Que.push(make_tuple(dist[gx][gy], gx, gy)); int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0,1, 0, -1 }; while (!Que.empty()) { tuple<long long, int, int> tup = Que.top(); Que.pop(); int cx = get<1>(tup), cy = get<2>(tup); for (int i = 0; i < 4; i++) { int ex = cx + dx[i], ey = cy + dy[i]; if (ex <= 0 || ey <= 0 || ex > H || ey > W) continue; long long cost = r * r + A[ex][ey]; if (dist[ex][ey] > dist[cx][cy] + 1LL * cost) { dist[ex][ey] = dist[cx][cy] + 1LL * cost; Que.push(make_tuple(dist[ex][ey], ex, ey)); } } } } void init_P() { for (int i = 0; i <= H + 1; i++) { for (int j = 0; j <= W + 1; j++) P[i][j] = (1LL << 62); } P[gx][gy] = A[gx][gy]; } void add_P() { for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) dist2[i][j] = min(dist2[i][j], P[i][j]); } } void dijkstra2() { for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) dist2[i][j] = (1LL << 62); } init_P(); for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) { if (i == gx && j == gy) continue; P[i][j] = min(P[i][j], P[i - 1][j] + A[i][j]); P[i][j] = min(P[i][j], P[i][j - 1] + A[i][j]); } } add_P(); init_P(); for (int i = 1; i <= H; i++) { for (int j = W; j >= 1; j--) { if (i == gx && j == gy) continue; P[i][j] = min(P[i][j], P[i - 1][j] + A[i][j]); P[i][j] = min(P[i][j], P[i][j + 1] + A[i][j]); } } add_P(); init_P(); for (int i = H; i >= 1; i--) { for (int j = 1; j <= W;j++) { if (i == gx && j == gy) continue; P[i][j] = min(P[i][j], P[i + 1][j] + A[i][j]); P[i][j] = min(P[i][j], P[i][j - 1] + A[i][j]); } } add_P(); init_P(); for (int i = H; i >= 1; i--) { for (int j = W; j >= 1; j--) { if (i == gx && j == gy) continue; P[i][j] = min(P[i][j], P[i + 1][j] + A[i][j]); P[i][j] = min(P[i][j], P[i][j + 1] + A[i][j]); } } add_P(); } int main() { scanf("%lld%lld%lld%lld", &H, &W, &gx, &gy); for (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++) scanf("%lld", &A[i][j]); } for (int i = 1; i <= 250; i++) { dijkstra(i); for (int j = 1; j <= H; j++) { for (int k = 1; k <= W; k++) val[i][j][k] = dist[j][k]; } } dijkstra2(); scanf("%lld", &Q); for (int i = 1; i <= Q; i++) { long long cx, cy, k; scanf("%lld%lld%lld", &cx, &cy, &k); long long cost = 0; if (k >= 250LL) { cost = 1LL * (abs(cx - gx) + abs(cy - gy) + 1LL) * k * k + dist2[cx][cy]; } else { cost = val[k][cx][cy]; } printf("%lld\n", cost); } return 0; }