백준 소스코드 [C++] 1261 알고스팟

https://www.acmicpc.net/problem/1261

1261번: 알고스팟

백준 소스코드 [C++] 1261 알고스팟

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#define MAX 987654321
using namespace std;
int arr[102][102], n, m;
int dist[102][102];
pair<int, int> pp, p[4] = { {1,0}, {0,1}, {-1,0}, {0,-1} };
queue <pair<int, int> > q;
void bfs() {
	while (q.empty() != true) {
		pp = q.front();
		q.pop();
		int y = pp.first, x = pp.second;
		for (int i = 0;i < 4;i++) {
			int dy = p[i].first, dx = p[i].second;
			if (arr[y + dy][x + dx] == 0) {
				if (dist[y + dy][x + dx] > dist[y][x]) {
					q.push({ y + dy,x + dx });
					dist[y + dy][x + dx] = dist[y][x];
				}
			}
			else if (arr[y + dy][x + dx] == 1) {
				if (dist[y + dy][x + dx] > dist[y][x] + 1) {
					q.push({ y + dy,x + dx });
					dist[y + dy][x + dx] = dist[y][x] + 1;
				}
			}
		}
	}
	return;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> m >> n;
	string s;
	for (int i = 0;i <= n + 1;i++)for (int j = 0;j <= m + 1;j++) arr[i][j] = 2;
	for (int i = 1;i <= n;i++) {
		cin >> s;
		for (int j = 1;j <= m;j++) {
			arr[i][j] = s[j - 1] - '0';
		}
	}

	for (int i = 1;i <= n;i++)for (int j = 1;j <= m;j++) {
		dist[i][j] = MAX;
	}
	dist[1][1] = 0;
	q.push({ 1,1 });
	bfs();
	cout << dist[n][m] << '\n';
	return 0;
}