Submission #1318421

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <numeric>
#include <fstream>
#include <queue>
using namespace std;
#define fol(i,n) for (int i=0;i<n;i++)
#define db(a) cout << a<< endl;
typedef pair <int,int>P;
int main(){
    int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
    int R,C,I=10000000,sx,sy,gx,gy;
    cin >> R>>C;
    char a[C][R];
int b[C][R];//a[x][y]
    cin >> sy>>sx>>gy>>gx;
    fol (i,R) fol(j,C){cin >>a[j][i];b[j][i]=I;}
    queue<P>q;
    q.push(P(sx,sy));
    b[sx-1][sy-1]=0;
    while(q.size()){
        P p= q.front();
        q.pop();
        if (p.first==gx&&p.second==gy) break;
        fol(i,4){
            int nx = p.first+dx[i],ny=p.second+dy[i];
            if (nx>=0&&nx<C&&ny>=0&&ny<R&&a[nx-1][ny-1]!='#'&&b[nx-1][ny-1]==I){
                q.push(P(nx,ny));
                b[nx-1][ny-1]=b[p.first-1][p.second-1]+1;
            }}}
                cout << b[gx-1][gy-1]<<endl;
    return 0;
}

Submission Info

Judge Result