Submission #1767193

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

//int dy[8]={1,1,1,0,0,-1,-1,-1};
//int dx[8]={-1,0,1,-1,1,-1,0,1};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int R,C,Sy,Sx,Gy,Gx;
	cin>>R>>C;
	cin>>Sy>>Sx>>Gy>>Gx;
	Sy--;Sx--;Gy--;Gx--;
	pi S,G;
	S=mp(Sy,Sx);
	G=mp(Gy,Gx);
	vector<string>c(R);
	rep(i,R){
		cin>>c[i];
	}
	vvi d(R,vi(C,-1));
	queue<pi> q;
	q.push(S);
	d[Sy][Sx]=0;
	while(!q.empty()){
		pi tmp=q.front();
		int nd=d[tmp.first][tmp.second];
		q.pop();
	//	p(tmp.first)P(tmp.second)
		if(tmp.first==Gy&&tmp.second==Gx){
			break;
		}
		rep(i,4){
			int ny=tmp.first+dy[i];
			int nx=tmp.second+dx[i];
	//		p(ny)P(nx)
			if(ny>=0&&ny<R&&nx>=0&&nx<C&&c[ny][nx]=='.'&&d[ny][nx]==-1){
				d[ny][nx]=nd+1;
				q.push(mp(ny,nx));
			}
		}

	}
	P(d[Gy][Gx])
	return 0;
}

Submission Info

Judge Result