Submission #1494302

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int dist[50][50];
    int direc[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
    typedef pair<int,int> P;
    queue<P> q;
    int sy,sx,gy,gx;
    vector<string> S;
    int R,C;
    cin >> R >> C >> sy >> sx >> gy >> gx;
    sx--;
    sy--;
    gx--;
    gy--;
    
    for ( int i = 0; i < 50; i++ ) {
    for ( int j = 0; j < 50; j++ ) {
        dist[i][j] = INT_MAX;
    }
    }
    
    S.resize(R);
    
    for ( int i = 0; i < R; i++ ) {
        cin >> S[i];
    }
    
    q.push( make_pair(sy,sx) );
    dist[sy][sx] = 0;
    
    while( !q.empty() ) {
        
        P p = q.front();
        q.pop();
        
        for ( int i = 0; i < 4; i++ ) {
            int y = p.first + direc[i][0];
            int x = p.second + direc[i][1];
            
            if ( x >= 0 && y >= 0 && x < C && y < R && S[y][x] != '#' && dist[y][x] == INT_MAX ) {
                q.push( make_pair(y,x) );
                dist[y][x] = dist[p.first][p.second]+1;
            }
        }
        
    }
    
    cout << dist[gy][gx] <<  endl;
    
    return 0;
}

Submission Info

Judge Result