Submission #691655

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <map>
 
using namespace std;
 
int field[51][51];
bool asiato[51][51];
 
int main(){
	int i, j, k, l, m, n,x,y;
    char c;
	
    int w,h;
    int sx,sy,gx,gy;
    
    cin >> h>>w;
    
    cin >> sy>>sx>>gy>>gx;
    
    for (y=1;y<=h;y++)
        for(x=1;x<=w;x++){
            cin>>c;
            if (c!='.' && c!='#'){x--;continue;}
            field[x][y]=c=='#'?0:1;
        }
    
    queue<vector<int>> que;
    que.push(vector<int>{sx,sy,0});
    while(!que.empty()){
        vector<int> &v=que.front();
        x=v[0];y=v[1];k=v[2];
        que.pop();
        if (asiato[x][y]) continue;
        asiato[x][y]=true;
        if (x==gx && y==gy){
            cout << k << endl;
            return 0;
        }
        if (field[x-1][y])
            que.push(vector<int>{x-1,y,k+1});
        if (field[x+1][y])
            que.push(vector<int>{x+1,y,k+1});
        if (field[x][y-1])
            que.push(vector<int>{x,y-1,k+1});
        if (field[x][y+1])
            que.push(vector<int>{x,y+1,k+1});
    }
    return 0;
}
    

Submission Info

Judge Result