Submission #164674

---

Source Code Expand

#include <bits/stdc++.h>
/*
#include <queue>
#include <iostream>
#include <string>
#include <algorithm>
*/
using namespace std;

int main()
{
    int n, m, sr, sc, gr, gc;
    cin>>n>>m>>sr>>sc>>gr>>gc;
    vector<string> Map(n);
    for(auto& v: Map) cin>>v;

    queue<pair<int, int>> q;
    vector<vector<int>> v(n, vector<int>(m));
    int dr[4]={-1, 0, 1, 0};
    int dc[4]={0, -1, 0, 1};

    sr--, sc--, gr--, gc--;
    q.push(make_pair(sr, sc));
    v[sr][sc]=1;
    pair<int, int> goal=make_pair(gr, gc);
    while (!q.empty()) {
        auto p=q.front(); q.pop();
        if (p==goal) break;

        for(int i=0;i<4;++i) {
            int r=p.first+dr[i];
            int c=p.second+dc[i];
            if (r<0 or r>=n or c<0 or c>=m) continue;
            if (Map[r][c]=='#') continue;
            if (v[r][c]) continue;
            q.push(make_pair(r, c));
            v[r][c]=v[p.first][p.second]+1;
        }
    }
    cout<<v[gr][gc]-1<<endl;
}

Submission Info

Judge Result