Submission #162943

---

Source Code Expand

//============================================================================
// Name        : abc007c.cpp
// Author      : afterCmidday
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#define INF 0x3fffffff
using namespace std;

int main() {
	pair<int,int> l, s, g;
	vector<string> vs;
	vector<vector<int> > vv;
	queue<pair<int,int> > qp;

	const int dy[4] = {-1,0,1,0}, dx[4] = {0,1,0,-1};

	cin >> l.first >> l.second;
	cin >> s.first >> s.second;
	cin >> g.first >> g.second;
	s.first--; s.second--;
	g.first--; g.second--;
	cin.get();
	for(int i = 0;i < l.first;i++){
		string in;
		getline(cin,in);
		vs.push_back(in);
		vector<int> v;
		for(int j = 0;j < l.second;j++){
			v.push_back(INF);
		}
		vv.push_back(v);
	}
	vv[s.first][s.second] = 0;
	qp.push(s);
	while(qp.size()){
		pair<int,int> p = qp.front();
		qp.pop();
		for(int i = 0;i < 4;i++){
			if(0 <= p.first + dy[i] && p.first + dy[i] < l.first && 0 <= p.second + dx[i] && p.second + dx[i] < l.second && vv[p.first + dy[i]][p.second + dx[i]] > vv[p.first][p.second] + 1 && vs[p.first + dy[i]][p.second + dx[i]] != '#'){
				vv[p.first + dy[i]][p.second + dx[i]] = vv[p.first][p.second] + 1;
				qp.push(make_pair(p.first + dy[i],p.second + dx[i]));
			}
		}
	}
	cout << vv[g.first][g.second] << endl;

	return 0;
}

Submission Info

Judge Result