結果

問題 No.867 避難経路
ユーザー e869120e869120
提出日時 2019-08-15 12:31:17
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,461 ms / 6,000 ms
コード長 3,068 bytes
コンパイル時間 1,260 ms
コンパイル使用メモリ 88,004 KB
実行使用メモリ 139,356 KB
最終ジャッジ日時 2023-10-19 18:56:46
合計ジャッジ時間 66,693 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 19 ms
74,300 KB
testcase_01 AC 19 ms
74,300 KB
testcase_02 AC 18 ms
74,300 KB
testcase_03 AC 18 ms
74,300 KB
testcase_04 AC 19 ms
74,300 KB
testcase_05 AC 19 ms
74,300 KB
testcase_06 AC 19 ms
74,300 KB
testcase_07 AC 19 ms
74,300 KB
testcase_08 AC 19 ms
74,300 KB
testcase_09 AC 19 ms
74,300 KB
testcase_10 AC 19 ms
74,300 KB
testcase_11 AC 19 ms
74,300 KB
testcase_12 AC 18 ms
74,300 KB
testcase_13 AC 19 ms
74,300 KB
testcase_14 AC 19 ms
74,300 KB
testcase_15 AC 2,402 ms
138,168 KB
testcase_16 AC 2,288 ms
139,268 KB
testcase_17 AC 2,461 ms
139,272 KB
testcase_18 AC 2,314 ms
139,272 KB
testcase_19 AC 2,309 ms
139,248 KB
testcase_20 AC 2,289 ms
139,192 KB
testcase_21 AC 2,255 ms
139,320 KB
testcase_22 AC 2,316 ms
139,256 KB
testcase_23 AC 2,417 ms
139,256 KB
testcase_24 AC 2,254 ms
139,256 KB
testcase_25 AC 2,266 ms
139,356 KB
testcase_26 AC 2,306 ms
139,128 KB
testcase_27 AC 2,322 ms
139,128 KB
testcase_28 AC 2,239 ms
139,112 KB
testcase_29 AC 2,347 ms
139,112 KB
testcase_30 AC 1,892 ms
139,112 KB
testcase_31 AC 1,943 ms
139,128 KB
testcase_32 AC 1,940 ms
139,128 KB
testcase_33 AC 1,922 ms
139,128 KB
testcase_34 AC 1,955 ms
139,000 KB
testcase_35 AC 2,100 ms
139,000 KB
testcase_36 AC 2,107 ms
138,748 KB
testcase_37 AC 1,934 ms
138,004 KB
testcase_38 AC 1,933 ms
138,004 KB
testcase_39 AC 1,917 ms
138,028 KB
testcase_40 AC 1,879 ms
138,032 KB
testcase_41 AC 24 ms
108,828 KB
testcase_42 AC 24 ms
109,204 KB
testcase_43 AC 25 ms
109,204 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

const long long BASE = 252;

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 <= BASE; 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 >= BASE) {
			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;
}
0