Skip to content

[hyodol] 백준 1525 - 퍼즐 문제 풀이 #80

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 1 commit into from
Jun 25, 2019
Merged

[hyodol] 백준 1525 - 퍼즐 문제 풀이 #80

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
63 changes: 63 additions & 0 deletions 190621/hyodol/1525.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
// BOJ 1525 - 퍼즐
#include <iostream>
#include <unordered_map>
#include <string>
#include <queue>
using namespace std;
const int dy[] = {-1, 1, 0, 0};
const int dx[] = {0, 0, -1, 1};

int bfs(int start) {
unordered_map<int, int> um;
queue<int> q;

um[start] = 0;
q.push(start);

while (!q.empty()) {
int current = q.front();
q.pop();

if (current == 123456789)
return um[current];

string strCurrent = to_string(current);
int index = (int)strCurrent.find('9');
int cy = index / 3, cx = index % 3;

for (int d = 0; d < 4; d++) {
int ny = cy + dy[d];
int nx = cx + dx[d];
if (ny < 0 || ny >= 3 || nx < 0 || nx >= 3)
continue;

string strNext = strCurrent;
swap(strNext[cy * 3 + cx], strNext[ny * 3 + nx]);
int next = stoi(strNext);
if (um.count(next) == 0) {
um[next] = um[current] + 1;
q.push(next);
}
}
}

return -1;
}

int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);

int start = 0;
for (int y = 0; y < 3; y++) {
for (int x = 0; x < 3; x++) {
int num;
cin >> num;
if (num == 0) num = 9;
start = start * 10 + num;
}
}

cout << bfs(start) << '\n';
return 0;
}