백준 쉬운 최단거리

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

14940번: 쉬운 최단거리

회식 후 가볍게 bfs 풀기~

#include <iostream>
#include <vector>
#include <queue>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stack>
using namespace std;

struct Point {
	int i, j, t, cnt,power;
	char c;
};

void Prints(vector<vector<int>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j]<<" ";
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<bool>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<vector<char>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<vector<bool>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(string str, int n) {
	for (int i = 0; i < n; i++) {
		cout << str[i] << ",";
	}
	cout << endl;
}

struct Data {
	int index;
	vector<bool>bVisited;
};

struct Word {
	std::string word;
	int count;
};
bool compares(const Data &a, const Data &b) {
	return a.index < b.index;
}
int main() {
	//N개 도시 
	//m
	int n, m;
	cin >> n >> m;
	
	vector<vector<int>>maps;
	vector<bool>tmpVisited(m,false);

	vector<vector<bool>>bVisited(n, tmpVisited);
	Point p;
	for (int i = 0; i < n; i++) {
		vector<int>tmpMaps;
		for (int j = 0; j < m; j++) {
			int tmp;
			cin >> tmp;
			if (tmp == 2) {
				p.i = i;
				p.j = j;
			}
			if (tmp == 0) {
				bVisited[i][j] = true;
			}
			tmpMaps.push_back(tmp);
		}
		maps.push_back(tmpMaps);
	}
	
	queue<Point>q;
	p.cnt = 0;
	q.push(p);
	int cnt = 0;
	
	maps[p.i][p.j] = p.cnt;
	while (!q.empty()) {
		Point start = q.front();
		q.pop();
		
		bVisited[start.i][start.j] = true;
		int diri[] = {1,-1,0,0};
		int dirj[] = {0,0,1,-1 };
		for (int i = 0; i < 4; i++) {
			int tmpDiri = start.i + diri[i];
			int tmpDirj = start.j + dirj[i];
			if (tmpDiri == -1 || tmpDirj == -1 || tmpDiri >= n || tmpDirj >= m) {
				continue;

			}
			if (bVisited[tmpDiri][tmpDirj]==true) {
				continue;
			}
			
			bVisited[tmpDiri][tmpDirj] = true;
			Point tmpp;
			tmpp.i = tmpDiri;
			tmpp.j = tmpDirj;
			tmpp.cnt = start.cnt+1;
			maps[tmpDiri][tmpDirj] = start.cnt + 1;
			
			
			q.push(tmpp);

		}
	}
	for (int i = 0; i < n; i++) {
		
		for (int j = 0; j < m; j++) {
			if (bVisited[i][j] == false && maps[i][j] == 1) {
				maps[i][j] = -1;
			}
		}
		
	}
	Prints(maps, n, m);
	return 0;
}