백준 1194번 (달이 차오른다, 가자., C++, BFS, 비트 마스킹) / 추가 반례 [BAEKJOON]

1 7
f0.F..1

7

5 5
....1
#1###
.1.#0
....A
.1.#.

-1

7 8
a#c#eF.1
.#.#.#..
.#B#D###
0....F.1
C#E#A###
.#.#.#..
d#f#bF.1

55

3 4
1..0
###.
1...

3

3 5
..0..
.###.
..1.A

6

4 5
0....
.#B#A
.#.#.
b#a#1

19

1 11
c.0.C.C.C.1

12

3 6
###...
#0A.1a
###...

-1

2 7
1F.f#.0
A...#.a

-1

2 7
1F.f..0
A.....a

6

2 7
1F.f#.0
A...#.a

-1

8 14
1FD...b#....f#
AC.....#.....#
#.....##.....#
#cd....AC....a
1BD....#.....#
AC.....AC.....
#.....#.......
.............0

26

48 7
1FD....
BC....a
#.....#
#cd....
.BD....
AC.....
#.....#
f#...##
1##.###
##....a
#.....#
#......
..#b#..
...#...
#.....#
.......
#.....#
f#...##
1##.###
##....a
#.....#
#......
..#b#..
...#...
#.....#
.......
.BD....
AC.....
#.....#
f#...##
1##.###
##....a
#.....#
#......
..#b#..
...#...
#.....#
.......
#.....#
f#...##
1##.###
##....a
#.....#
#......
..#b#..
...#...
#.....#
......0

67

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

#include<iostream>

using namespace std;

constexpr auto MAX = 51;;

int N, M; // 세로 N 가로 M
int startX, startY; // 처음 시작위치를 저장하기 위함 
char map[MAX][MAX];




void Initalization()
{
	cin >> N >> M;

	//전부 이동이 불가능한 벽으로 변경
	for (int i = 0; i <= N+1; i++)
	{
		for (int j = 0; j <= M+1; j++)
		{
			map[i][j] = '#';
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M ; j++)
		{
			cin >> map[i][j];
			if (map[i][j] == '0')
			{
				startY = i;
				startX = j;
			}
		}
	}
}


int main()
{
	Initalization();

	 cout << startX << " " << startY << "  "<< map[0][1];
	 cout << "\n--------------------------------------------\n";
	 
	 for (int i = 0; i <= N + 1; i++)
	 {
	 	for (int j = 0; j <= M + 1; j++)
	 	{
	 		cout << map[i][j];
	 	}
	 	cout << "\n";
	 }

	return 0;
}

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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

constexpr auto MAX = 51;;


int N, M; // 세로 N 가로 M
int startX, startY; // 처음 시작위치를 저장하기 위함 
char map[MAX][MAX];

// 하 상 우 좌
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };

typedef struct myStruct {
	int x, y;
	bool checkKey[26] = { false };
	int cnt = 0;
	bool checkMap[MAX][MAX] = { false };
};

myStruct tempStruct;

queue<myStruct> myQueue;



void Initalization()
{
	cin >> N >> M;
	myStruct tempStruct;

	//전부 이동이 불가능한 벽으로 변경
	for (int i = 0; i < MAX; i++)
	{
		for (int j = 0; j < MAX; j++)
		{
			map[i][j] = '#';
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M; j++)
		{
			cin >> map[i][j];
			if (map[i][j] == '0')
			{
				startY = i;
				startX = j;
				cout << "(startX, startY) : " << startX << " /" << startY << "\n";
			}
		}
	}
}

int BFS()
{

	map[startY][startX] = '.';

	myStruct mystruct;
	mystruct.checkMap[startY][startX] = true;
	mystruct.x = startX;
	mystruct.y = startY;
	myQueue.push(mystruct);
	cout << myQueue.size() << "\n";
	while (!myQueue.empty())
	{
		tempStruct = myQueue.front();
		tempStruct.cnt = myQueue.front().cnt + 1;
		myQueue.pop();
		for (int k = 0; k < 4; k++)
		{
			cout << "\n-----------------움직임 전---------------------\n";

			for (int i = 0; i <= N + 1; i++)
			{
				for (int j = 0; j <= M + 1; j++)
				{
					cout << map[i][j];
				}
				cout << "\n";
			}


			switch (k)
			{
				case 0:
					cout << "\n하\n";
					break;
				case 1:
					cout << "\n상\n";
					break;
				case 2:
					cout << "\n우\n";
					break;
				case 3:
					cout << "\n좌\n";
					break;
			}

			mystruct = tempStruct;
			cout << "mystruct.cnt : "<< mystruct.cnt << "\n";
			cout << "이동전의 위치 : mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
			// 상하 좌우로 검색
			mystruct.x = tempStruct.x + dx[k];
			mystruct.y = tempStruct.y + dy[k];
	
			// 맵의 범위를 넘어가거나 // 벽을 만나거나 //  
			if (mystruct.x <= 0 || mystruct.x > M || mystruct.y <= 0 || mystruct.y > N || map[mystruct.y][mystruct.x] == '#' || mystruct.checkMap[mystruct.y][mystruct.x] == true)
			{
				cout << "checkMap[mystruct.y][mystruct.x] : " << mystruct.checkMap[mystruct.y][mystruct.x] << "\n";
				cout << "이동한 후의 위치 : map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
				cout << "이동한 후의 위치 :  " << "mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
				cout << "맵의 범위를 넘어가거나 // 벽을 만나거나 " << "\n\n";
				continue;
			}
			else if( 65 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 90 )
			{
				cout << "map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
				cout << "(int)map[mystruct.y][mystruct.x]] : " << (int)map[mystruct.y][mystruct.x] << "\n";
				cout << "(int)map[mystruct.y][mystruct.x]-65] : " << (int)map[mystruct.y][mystruct.x] - 65 << "\n";
				// 키가 없으면 넘어간다.
				if (mystruct.checkKey[(int)map[mystruct.y][mystruct.x]-65] == false)
				{
					cout << "// 키가 없으면 넘어간다." << "\n\n";
					cout << "이동한 후의 위치 : map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
					cout << "이동한 후의 위치 :  " << "mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
					continue;
				}
				else
				{
					cout << "// 키가 있으면 빈칸으로 만든다." << "\n\n";
					cout << "이동한 후의 위치 : map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
					cout << "이동한 후의 위치 :  " << "mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
					map[mystruct.y][mystruct.x] = '.';
					mystruct.checkMap[mystruct.y][mystruct.x] = true;
				}

			}
			else if (97 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 122)
			{
				cout << "/키를 줍고 열쇠 위치를 빈칸으로 만들고 전체 방문 체크 초기화" << "\n\n";
				cout << "이동한 후의 위치 : map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
				cout << "이동한 후의 위치 :  " << "mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
				mystruct.checkKey[(int)map[mystruct.y][mystruct.x] - 97] = true;
				map[mystruct.y][mystruct.x] = '.';

				for (int i = 1; i <= N; i++)
				{
					for (int j = 1; j <= M; j++)
					{
						cout << "초기화";
						mystruct.checkMap[i][j] = false;
					}
				}

			}
			else if (map[mystruct.y][mystruct.x] == '1')
			{
				// 미로를 탈출합니다.
				return mystruct.cnt;
			}
			else if (map[mystruct.y][mystruct.x] == '.'|| map[mystruct.y][mystruct.x] == '@')
			{
				cout << "빈 공간에 도착" << "\n\n";
				cout << "이동한 후의 위치 : map[mystruct.y][mystruct.x] : " << map[mystruct.y][mystruct.x] << "\n";
				cout << "이동한 후의 위치 :  " << "mystruct.x : " << mystruct.x << " mystruct.y : " << mystruct.y << "\n";
				mystruct.checkMap[mystruct.y][mystruct.x] = true;
				map[mystruct.y][mystruct.x] = '@';
			}
			cout << "\n-----------------움직임 후---------------------\n";

			for (int i = 0; i <= N + 1; i++)
			{
				for (int j = 0; j <= M + 1; j++)
				{
					cout << map[i][j];
				}
				cout << "\n";
			}
			cout << "map[mystruct.y][mystruct.x] : "<< map[mystruct.y][mystruct.x] << "큐에 저장\n";
			myQueue.push(mystruct);
			cout << myQueue.size()<<"\n";
		}
	}

	// 출구를 찾지 못했을 경우 -1 리턴
	return -1;
	
	
	// cout << "A : " << (int)'A' << " a : " << (int)'a' << "\n";
	// cout << "B : " << (int)'B' << " b : " << (int)'b' << "\n";
	//A : 65 Z : 90
	//  a : 97
	//B: 66 b : 98


}

int main()
{
	 cout << ". : " << (int)'.' << " . : " << (int)'.' << "\n";
	// cout << "a : " << (int)'a' << " z : " << (int)'z' << "\n";
	// cout << "B : " << (int)'B' << " b : " << (int)'b' << "\n";
	Initalization();

	cout << "\n--------------------------------------------\n";

	for (int i = 0; i <= N + 1; i++)
	{
		for (int j = 0; j <= M + 1; j++)
		{
			cout << map[i][j];
		}
		cout << "\n";
	}


	cout << "\n\n 답 : " << BFS() << "\n\n\n";

	cout << startX << " " << startY << "  ";
	 cout << "\n--------------------------------------------\n";
	 
	 for (int i = 0; i <= N + 1; i++)
	 {
	 	for (int j = 0; j <= M + 1; j++)
	 	{
	 		cout << map[i][j];
	 	}
	 	cout << "\n";
	 }

	return 0;
}

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
115
116
117
118
119
120
121

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

constexpr auto MAX = 51;


int N, M; // 세로 N 가로 M
int startX, startY; // 처음 시작 위치를 저장하기 위함 
char map[MAX][MAX];
bool checkMap[MAX][MAX][1 << 6] = {false};
// 하 상 우 좌
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };

typedef struct myStruct {
	int x, y;
	int checkKey = 0;
	int cnt = 0;
};

myStruct tempStruct;

queue<myStruct> myQueue;



void Initalization()
{
	cin >> N >> M;
	myStruct tempStruct;

	//전부 이동이 불가능한 벽으로 변경
	for (int i = 0; i < MAX; i++)
	{
		for (int j = 0; j < MAX; j++)
		{
			map[i][j] = '#';
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M; j++)
		{
			cin >> map[i][j];
			if (map[i][j] == '0')
			{
				startY = i;
				startX = j;
			}
		}
	}
}

int BFS()
{

	map[startY][startX] = '.';
	myStruct mystruct;
	
	mystruct.x = startX;
	mystruct.y = startY;
	myQueue.push(mystruct);
	while (!myQueue.empty())
	{
		tempStruct = myQueue.front();
		tempStruct.cnt = myQueue.front().cnt + 1;
		myQueue.pop();
		for (int k = 0; k < 4; k++)
		{
			mystruct = tempStruct;
			mystruct.x = tempStruct.x + dx[k];
			mystruct.y = tempStruct.y + dy[k];

			if (mystruct.x <= 0 || mystruct.x > M || mystruct.y <= 0 || mystruct.y > N || map[mystruct.y][mystruct.x] == '#')// )|| checkMap[mystruct.y][mystruct.x][mystruct.checkKey] == true)
			{
				continue;
			}
			else if( 65 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 90 )
			{


				if ((mystruct.checkKey & 1 << ((int)map[mystruct.y][mystruct.x] - 64)) <= 0 )
				{
					continue;
				}
				else
				{
					
				}
			}
			else if (97 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 122)
			{

				mystruct.checkKey = mystruct.checkKey | 1 << ((int)map[mystruct.y][mystruct.x] - 96);
			}
			else if (map[mystruct.y][mystruct.x] == '1')
			{
				return mystruct.cnt;
			}
			else if (map[mystruct.y][mystruct.x] == '.')
			{
				
			}
			checkMap[mystruct.y][mystruct.x][mystruct.checkKey] = true;
			myQueue.push(mystruct);
		}
	}

	return -1;
}

int main()
{
	Initalization();
	cout << BFS();
	return 0;
}

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
115

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

constexpr auto MAX = 51;


int N, M; // 세로 N 가로 M
int startX, startY; // 처음 시작 위치를 저장하기 위함 
char map[MAX][MAX];
bool checkMap[MAX][MAX][1 << 6] = { false };
// 하 상 우 좌
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };



typedef struct myStruct {
	int x, y;
	int checkKey = 0;
	int cnt = 0;
};

myStruct tempStruct;
queue<myStruct> myQueue;



void Initalization()
{
	cin >> N >> M;
	for (int i = 0; i < MAX; i++)
	{
		for (int j = 0; j < MAX; j++)
		{
			map[i][j] = '#';
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M; j++)
		{
			cin >> map[i][j];
			if (map[i][j] == '0')
			{
				startY = i;
				startX = j;
			}
		}
	}
}

int BFS()
{
	myStruct mystruct;
	map[startY][startX] = '.';
	mystruct.x = startX;
	mystruct.y = startY;
	myQueue.push(mystruct);
	while (!myQueue.empty())
	{
		tempStruct = myQueue.front();
		tempStruct.cnt = myQueue.front().cnt + 1;
		myQueue.pop();
		for (int k = 0; k < 4; k++)
		{
			mystruct = tempStruct;
			mystruct.x = tempStruct.x + dx[k];
			mystruct.y = tempStruct.y + dy[k];

			if (mystruct.x <= 0 || mystruct.x > M || mystruct.y <= 0 || mystruct.y > N || map[mystruct.y][mystruct.x] == '#' || checkMap[mystruct.y][mystruct.x][tempStruct.checkKey] == true)
			{
				continue;
			}
			else if (65 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 90)
			{

				if ((mystruct.checkKey & 1 << ((int)map[mystruct.y][mystruct.x] - 'A')) > 0)
				{
					map[mystruct.y][mystruct.x] = '.';
				}
				else
				{
					checkMap[mystruct.y][mystruct.x][mystruct.checkKey] = true;
					continue;
				}
			}
			else if (97 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 122)
			{
				mystruct.checkKey = mystruct.checkKey | 1 << ((int)map[mystruct.y][mystruct.x] - 'a');
			}
			else if (map[mystruct.y][mystruct.x] == '1')
			{
				return mystruct.cnt;
			}
			else if (map[mystruct.y][mystruct.x] == '.')
			{
				checkMap[mystruct.y][mystruct.x][mystruct.checkKey] = true;
			}
			myQueue.push(mystruct);
		}
	}

	return -1;
}

int main()
{
	Initalization();
	cout << BFS();
	return 0;
}

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;
constexpr auto MAX = 51;

int N, M; // 세로 N 가로 M
int startX, startY; // 처음 시작위치를 저장 
char map[MAX][MAX]; // 맵을 저장
bool checkMap[MAX][MAX][1 << 6] = { false }; // 비트 마스킹
// 하 상 우 좌
int dx[] = { 0, 0, 1, -1 };
int dy[] = { 1, -1, 0, 0 };

typedef struct myStruct {
	int x, y;
	int checkKey = 0;
	int cnt = 0;
};

myStruct tempStruct;
queue<myStruct> myQueue;



void Initalization()
{
	cin >> N >> M;
	for (int i = 0; i < MAX; i++)
	{
		for (int j = 0; j < MAX; j++)
		{
			map[i][j] = '#';
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M; j++)
		{
			cin >> map[i][j];
			if (map[i][j] == '0')
			{
				startY = i;
				startX = j;
			}
		}
	}
}

int BFS()
{
	myStruct mystruct;
	map[startY][startX] = '.';
	mystruct.x = startX;
	mystruct.y = startY;
	myQueue.push(mystruct);
	while (!myQueue.empty())
	{
		tempStruct = myQueue.front();
		tempStruct.cnt = myQueue.front().cnt + 1;
		myQueue.pop();
		for (int k = 0; k < 4; k++)
		{
			mystruct = tempStruct;
			mystruct.x = tempStruct.x + dx[k];
			mystruct.y = tempStruct.y + dy[k];

			// 범위를 벗어나거나 벽이 있을 경우에 넘어간다.
			if (mystruct.x <= 0 || mystruct.x > M || mystruct.y <= 0 || mystruct.y > N || map[mystruct.y][mystruct.x] == '#' 
				|| checkMap[mystruct.y][mystruct.x][tempStruct.checkKey] == true)
			{
				continue;
			}
			else if (65 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 90)
			{ // 문의 위치일 경우

				// 열쇠를 가지고 있다면
				if ((mystruct.checkKey & 1 << ((int)map[mystruct.y][mystruct.x] - 'A')) > 0)
				{
					checkMap[mystruct.y][mystruct.x][mystruct.checkKey] = true;
				}
				else
				{
					//열쇠가 없다면 넘어간다.
					continue;
				}
			}
			else if (97 <= (int)map[mystruct.y][mystruct.x] && (int)map[mystruct.y][mystruct.x] <= 122)
			{
				// 열쇠의 위치일 경우 비트 마스킹
				mystruct.checkKey = mystruct.checkKey | 1 << ((int)map[mystruct.y][mystruct.x] - 'a');
			}
			else if (map[mystruct.y][mystruct.x] == '.')
			{
				// 빈곳일경우 
			}
			else if (map[mystruct.y][mystruct.x] == '1')
			{
				// 도착지점
				return mystruct.cnt;
			}

			checkMap[mystruct.y][mystruct.x][mystruct.checkKey] = true;
			myQueue.push(mystruct);
		}
	}

	return -1;
}

int main()
{
	Initalization();
	cout << BFS();
	return 0;
}