Submission #1649709

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fol(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long ll;
typedef pair<int,int> P;
typedef vector<P> vip;
void solve(){
    int R,C,sx,sy,gy,gx,x,y,count=0;
    cin >> R>>C>>sy>>sx>>gy>>gx;
    char mp[R][C];
    fol(i,R){
        fol(j,C) cin >> mp[i][j];
    }
    sx--;sy--;gx--;gy--;
    int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
    int d[R][C];
    fol(i,R){
        fol(j,C) d[i][j]=100000001;
    }
    d[sy][sx]=0;
    queue<P>q;
    q.push(P(sx,sy));
    while(q.size()){
        P p= q.front();
        q.pop();
        if (p.first==gx&&p.second==gy) break;
        fol(i,4){
            x = p.first+dx[i],y=p.second+dy[i];
            if(x>=0&&x<C&&y>=0&&y<R&&mp[y][x]!='#'&&d[y][x]==100000001){
                q.push(P(x,y));
                d[y][x]=d[p.second][p.first]+1;
            }
        }
    }
    cout << d[gy][gx] <<endl;
}

int main(){
/*/Debug by file input
    ifstream fin("input");
    cin.rdbuf(fin.rdbuf());// */
    solve();
    return 0;
}

Submission Info

Judge Result