#include #include #include #include #include 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, vector>, greater>> 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 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)) * k * k + dist2[cx][cy]; } else { cost = val[k][cx][cy]; } printf("%lld\n", cost); } return 0; }