Submission #842094

---

Source Code Expand

#include <iostream>
#include <string>
#include <queue>
using namespace std;

int v[2510];

int main()
{
    int R, C, sy, sx, gy, gx;
    cin>>R>>C>>sy>>sx>>gy>>gx;

    int s=(sy-1)*C+(sx-1), g=(gy-1)*C+(gx-1);

    string a;
    for(int i=0; i<R; ++i) {
        string t; cin>>t;
        a+=t;
    }

    queue<int> q;
    q.push(s);
    v[s]=1;
    while (!q.empty()) {
        int p=q.front(); q.pop();
        if (p==g) break;

        for(int d: {-1, 1, -C, C}) {
            int k=p+d;
            if (a[k]=='.' and !v[k]) {
                v[k]=v[p]+1;
                q.push(k);
            }
        }
    }
    cout<<v[g]-1<<endl;
}

Submission Info

Judge Result