백준 2178번 C++
#include #include #include using namespace std; const int MAX=101;int n, m;int arr[MAX][MAX];queue way;int visited[MAX][MAX]; typedef struct {int x, y;}Move;Move mv[4] = { {0,-1},{0,1},{1,0},{-1,0} }; int bfs() {int answer = 0;way.push(make_pair(1,make_pair(1,1)));visited[1][1] = 1; while (!way.empty()) {int x = way.front().first;int y = way.front().second.first;int count = way.front().second.se..
2019. 2. 19.
백준 2589번 C++
#include #include #include using namespace std; const int MAX = 51;int n,m;char way[MAX][MAX];char shortestway[MAX][MAX]; typedef struct {int x, y;}Move;Move moves[4] = { {1,0},{-1,0},{0,1},{0,-1} }; int bfs(int i,int j) {int longestway=0;memset(shortestway, 0, sizeof(shortestway));queue q;q.push(make_pair(i, j)); while (!q.empty()) {int x = q.front().first;int y = q.front().second;q.pop(); for ..
2019. 1. 14.
