-
Notifications
You must be signed in to change notification settings - Fork 0
/
DP_3055_탈출.cpp
114 lines (94 loc) · 1.96 KB
/
DP_3055_탈출.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
/*
<오답노트>
고슴도치가 방문한 곳을 다시 방문하지 않는다는 조건문을 작성하지 않아 오답
*/
#include <iostream>
#include <string>
#include <queue>
#define ROWMAX 50
#define COLMAX 50
using namespace std;
char Map[ROWMAX][COLMAX];
bool check[ROWMAX][COLMAX];
queue <pair<int, int> > q;
queue <pair<int, int> > waterQ;
int dx[4] = { -1, 1, 0, 0 };
int dy[4] = { 0, 0, -1, 1 };
void bfs(int& result)
{
int count = 0;
while (!q.empty())
{
count++;
int q_size = q.size();
int wQ_size = waterQ.size();
while (wQ_size--)
{
int row = waterQ.front().first;
int col = waterQ.front().second;
waterQ.pop();
for (int i = 0; i < 4; i++)
{
int nextRow = row + dx[i];
int nextCol = col + dy[i];
if (nextRow >= 0 && nextRow < ROWMAX && nextCol >= 0 && nextCol < COLMAX)
{
if (Map[nextRow][nextCol] == '.')
{
Map[nextRow][nextCol] = '*';
waterQ.push(make_pair(nextRow, nextCol));
}
}
}
}
while (q_size--)
{
int row = q.front().first;
int col = q.front().second;
q.pop();
for (int i = 0; i < 4; i++)
{
int nextRow = row + dx[i];
int nextCol = col + dy[i];
if (Map[nextRow][nextCol] == 'D')
{
result = count;
return;
}
else if (nextRow >= 0 && nextRow < ROWMAX && nextCol >= 0 && nextCol < COLMAX)
{
if (Map[nextRow][nextCol] == '.' && check[nextRow][nextCol] == 0)
{
check[nextRow][nextCol] = 1;
q.push(make_pair(nextRow, nextCol));
}
}
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int rowNum, colNum, result = 0;
string input;
cin >> rowNum >> colNum;
for (int i = 0; i < rowNum; i++)
{
cin >> input;
for (int j = 0; j < colNum; j++)
{
Map[i][j] = input[j];
if (Map[i][j] == '*')
waterQ.push(make_pair(i, j));
else if (Map[i][j] == 'S')
q.push(make_pair(i, j));
}
}
bfs(result);
if (result)
cout << result;
else
cout << "KAKTUS";
}