Submission #162416

---

Source Code Expand

import std.stdio, std.string, std.conv;
import std.algorithm, std.array, std.typecons;

void main()
{
    for(string s; (s=readln().chomp()).length;)
    {
        auto RC = s.split().map!(to!int)();
        immutable auto R=RC[0], C=RC[1];
        auto sxy = readln().split().map!(to!int)();
        immutable auto sy=sxy[0], sx=sxy[1];
        auto gxy = readln().split().map!(to!int)();
        immutable auto gy=gxy[0], gx=gxy[1];
        auto c = new string[R];
        foreach(ref v; c)
            v = readln();
        auto m = new int[][](R,C);
        foreach(ref a; m)
            a[]=-1;
        alias Tuple!(int,"x",int,"y",int,"d") Point;
        Point[] q;
        q~=Point(sx-1,sy-1,0);
        while(!q.empty)
        {
            auto p = q.front; q.popFront();
            if(p.x<0 || C<=p.x || p.y<0 || R<=p.y || m[p.y][p.x]>=0 || c[p.y][p.x]=='#')
                continue;
            m[p.y][p.x]=p.d;
            q~=Point(p.x-1,p.y,p.d+1);
            q~=Point(p.x+1,p.y,p.d+1);
            q~=Point(p.x,p.y-1,p.d+1);
            q~=Point(p.x,p.y+1,p.d+1);
        }
        writeln(m[gy-1][gx-1]);
    }
}

Submission Info

Judge Result