Submission #1500859

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>  
using namespace std;
#define eps 0.00000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
int distances[100][100] = {};
int grid[100][100] = {};
int main() {
	int a,b;
	cin >> a >> b;
	queue<pair<int, int>> wow;
	int c, d;
	cin >> c >> d;
	wow.push(make_pair(c, d));
	int e, f;
	cin >> e >> f;
	REP(i, a) {
		string s;
		cin >> s;
		REP(q, b) {
			if (s[q] == '#') {
				grid[i+1][q+1] = 1;
			}
		}
	}
	while (wow.empty() == false) {
		pair<int, int> now = wow.front();wow.pop();
		if (grid[now.first + 1][now.second] == 0) {
			if (distances[now.first + 1][now.second] == 0) {
				distances[now.first + 1][now.second] = distances[now.first][now.second] + 1;
				wow.push(make_pair(now.first + 1, now.second));
			}
		}
		if (grid[now.first - 1][now.second] == 0) {
			if (distances[now.first - 1][now.second] == 0) {
				distances[now.first - 1][now.second] = distances[now.first][now.second] + 1;
				wow.push(make_pair(now.first - 1, now.second));
			}
		}
		if (grid[now.first][now.second+1] == 0) {
			if (distances[now.first][now.second+1] == 0) {
				distances[now.first][now.second+1] = distances[now.first][now.second] + 1;
				wow.push(make_pair(now.first, now.second+1));
			}
		}
		if (grid[now.first][now.second - 1] == 0) {
			if (distances[now.first][now.second - 1] == 0) {
				distances[now.first][now.second - 1] = distances[now.first][now.second] + 1;
				wow.push(make_pair(now.first, now.second - 1));
			}
		}
	}
	distances[c][d] = 0;
	cout << distances[e][f] << endl;
	return 0;
}

Submission Info

Judge Result