Submission #1352997

---

Source Code Expand

import std.stdio, std.string, std.conv, std.range, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons, std.typetuple;
import core.bitop, std.datetime;

immutable int mod = 10^^9 + 7;
immutable int inf = 10^^5;

void main(){
    alias Pair = Tuple!(int, "y", int, "x");

    int r, c, sy, sx, gy, gx;
    readVars(r, c);
    readVars(sy, sx);
    readVars(gy, gx);

    sy--;sx--;gy--;gx--;

    auto maze = new char[][](r, c);
    iota(r).each!(i => maze[i][] = readln.chomp.to!(char[]));

    auto q = DList!Pair();
    auto d = new int[][](r, c);
    iota(r).each!(i => d[i][] = inf);
    d[sy][sx] = 0;
    q.insertBack(Pair(sy, sx));

    auto dy = [1, 0, -1, 0], dx = [0, 1, 0, -1];
    int ny, nx;

    while (!q.empty) {
        auto point = q.front; q.removeFront;

        if (point.y == gy && point.x == gx) {
            break;
        }

        foreach (i ; 0 .. 4) {
            ny = point.y + dy[i];
            nx = point.x + dx[i];

            if (0 <= ny && ny < r && 0 <= nx && nx < c && maze[ny][nx] == '.' && d[ny][nx] == inf) {
                d[ny][nx] = d[point.y][point.x] + 1;
                q.insertBack(Pair(ny, nx));
            }
        }
    }

    writeln(d[gy][gx]);
}


void readVars(T...)(auto ref T args)
{
    auto line = readln.split;
    foreach(ref arg ; args){
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    if(!line.empty){
        writeln(line);
        throw new Exception("args num < input num");
    }
}

Submission Info

Judge Result