Submission #363785

---

Source Code Expand

#include<vector>
#include<map>
#include<climits>
#include<set>
#include<queue>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<bitset>
#include<cstring>
#include<list>
#include<iterator>
using namespace std;
typedef vector<string>vs;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef pair<int,int>pii;
typedef long long ll;
typedef pair<ll,ll>pll;
#define rrep(i,x,n) for(int i=(x);i<(n);++i)
#define rep(i,x) rrep(i,0,(x))
#define fi first
#define se second
#define each(i,c) for(typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
struct data{
    int y,x,cost;
    data(int a,int b,int c):
        y(a),x(b),cost(c){}
    data(){}
};

int main(){
    int H,W,sy,sx,gy,gx;
    cin>>H>>W>>sy>>sx>>gy>>gx;
    sy--;sx--;gy--;gx--;

    char fld[64][64];
    rep(i,H)cin>>fld[i];

    bool used[64][64]={{0}};

    queue<data>Q;Q.push(data(sy,sx,0));
    int dx[]={0,-1,0,1},dy[]={-1,0,1,0};

    while(Q.size()){
        data d=Q.front();Q.pop();
        int y=d.y,x=d.x,cost=d.cost;
        if(y<0||y>=H||x<0||x>=W)continue;
        if(used[y][x])continue;
        if(fld[y][x]=='#')continue;
        if(y==gy&&x==gx){
            cout<<cost<<endl;
            break;
        }
        used[y][x]=true;
        rep(i,4){
            int ty=y+dy[i],tx=x+dx[i];
            Q.push(data(ty,tx,cost+1));
        }
    }
    return 0;
}

Submission Info

Judge Result