#include <cstdio>
#include <queue>
#include <map>
using namespace std;
typedef pair<pair<int, int>, pair<int, int> > MP;
#define mp(a,b) make_pair(a,b)
#define mf(a,b,c,d) mp(mp(a,b),mp(c,d))
int N, M, R, L;
char arr[11][11];
int robot[4];
int goal;
map<MP,int> seen;
struct Pos{
int y, x;
void append(int site){
y = site / M;
x = site % M;
}
};
void Push(int num, int next, int moves, queue<MP> &q){
MP p;
if (num == 0) p = mf(next, q.front().first.second, q.front().second.first, q.front().second.second);
else if (num == 1) p = mf(q.front().first.first, next, q.front().second.first, q.front().second.second);
else if (num == 2) p = mf(q.front().first.first, q.front().first.second, next, q.front().second.second);
else if (num == 3) p = mf(q.front().first.first, q.front().first.second, q.front().second.first, next);
if (seen.find(p) == seen.end()) {
q.push(p);
seen[p] = moves;
}
}
int bfs(){
int ans = 0;
int dy[] = { -1, 0, 0, 1 }, dx[] = { 0, 1, -1, 0 };
queue<MP> q; //좌표, 로봇번호
q.push(mf(robot[0],robot[1],robot[2],robot[3]));
while (!q.empty()){
int sz = q.size();
for (int s = 0; s < sz; s++){
Pos curr[4];
curr[0].append(q.front().first.first), curr[1].append(q.front().first.second),
curr[2].append(q.front().second.first), curr[3].append(q.front().second.second);
if (curr[0].y * M + curr[0].x == goal) return ans;
for (int r = 0; r < R; r++){
int y = curr[r].y, x = curr[r].x;
for (int i = 0; i < 4; i++){
int ny = y, nx = x;
while (1){
bool f = false;
ny += dy[i], nx += dx[i];
if (ny < 0 || ny >= N || nx < 0 || nx >= M || arr[ny][nx] == 'W') break;
for (int rr = 0; rr < R; rr++){
if (rr == r) continue;
if (ny == curr[rr].y && nx == curr[rr].x){ f = true; break; }
}
if (f) break;
}
ny -= dy[i], nx -= dx[i];
if (ny == y && nx == x) continue;
int next = ny*M + nx;
Push(r, next, ans, q);
}
}
q.pop();
}
ans++;
if (ans > L) return -1;
}
return -1;
}
int main(){
scanf("%d%d%d%d", &R, &M, &N, &L);
for (int n = 0; n < N; n++)
for (int m = 0; m < M; m++){
scanf(" %1c", &arr[n][m]);
if (arr[n][m] == 'X'){
goal = n*M + m;
arr[n][m] = '.';
}
for (int r = 1; r <= R; r++){
if (arr[n][m] - '0' == r){
robot[r - 1] = n*M + m;
arr[n][m] = '.';
}
}
}
int ans = bfs();
if (ans == -1) printf("NO SOLUTION\n");
else printf("%d\n", ans);
return 0;
}
| cs |
#include <cstdio>
#include <queue>
using namespace std;
char map[14][8];
int visit[14][8];
int group = 1;
void clear(){
for (int i = 0; i<12; i++)
for (int j = 0; j<6; j++)
if (visit[i][j] == group)
map[i][j] = '.';
}
int bfs(int iy, int ix){
int dy[4] = { -1, 0, 0, 1 }, dx[4] = { 0, 1, -1, 0 };
int cnt = 1;
queue<int> q;
q.push(iy * 6 + ix);
visit[iy][ix] = group;
while (!q.empty()){
int sz = q.size();
for (int s = 0; s < sz; s++){
int y = q.front() / 6, x = q.front() % 6;
q.pop();
for (int i = 0; i < 4; i++){
int ny = y + dy[i], nx = x + dx[i];
if (ny < 0 || ny >= 12 || nx < 0 || nx >= 6 || visit[ny][nx] > 0) continue;
if (map[ny][nx] == map[iy][ix]){
q.push(ny * 6 + nx);
visit[ny][nx] = group;
cnt++;
}
}
}
}
return cnt;
}
int main(){
for (int n = 0; n < 12; n++)
scanf("%s", map[n]);
int ans = 0;
while (1){
bool flag = false;
for (int n = 0; n < 12; n++){
for (int m = 0; m < 6; m++){
if (!visit[n][m] && map[n][m] != '.'){
if (bfs(n, m) >= 4)
flag = true, clear();
group++;
}
}
}
if (flag){
ans++;
for (int i = 0; i < 6; i++){
for (int j = 11; j >= 0; j--)
{
int x = j, y = i;
if (map[x][y] != '.')
{
x++;
while (x < 12 && map[x][y] == '.') swap(map[x][y], map[x - 1][y]), x++;
}
}
}
}
else break;
for (int n = 0; n < 12; n++)
for (int m = 0; m < 6; m++)
visit[n][m] = 0;
}
printf("%d\n", ans);
return 0;
}
| cs |
#include <cstdio>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define INF 987654321
#define MAX_N 5
#define MAX_M 9
int ans;
int buf[MAX_N * MAX_M];
char arr[MAX_N][MAX_M];
int bfs(vector<int> &input){
int move = 0;
int dy[] = { -1, 0, 0, 1 }, dx[] = { 0, 1, -1, 0 };
set<vector<int>> visit;
queue<vector<int>> q;
sort(input.begin(), input.end());
q.push(input);
visit.insert(input);
while (!q.empty()){
int sz = q.size();
for (int s = 0; s < sz; s++){
vector<int> pin = q.front();
int psize = pin.size();
q.pop();
ans = min(ans, psize);
buf[ans] = min(buf[ans], move);
if (psize == 1)
return 1;
char map[MAX_N + 1][MAX_M + 1] = { { "###...###" },
{ "........." },
{ "........." },
{ "........." },
{ "###...###" }};
for (int n : pin) map[n / MAX_M][n % MAX_M] = 'o';
for (int n = 0; n < pin.size(); ++n){
int y = pin[n] / MAX_M, x = pin[n] % MAX_M;
for (int i = 0; i < 4; i++){
int ny = y + dy[i], nx = x + dx[i];
if (ny < 0 || ny >= MAX_N || nx < 0 || nx >= MAX_M) continue;
if (map[ny][nx] == 'o'){ //pin[n] 과 ny,nx 는 인접
if (ny + dy[i] >= 0 && ny + dy[i] < MAX_N && nx + dx[i] >= 0 && nx + dx[i] < MAX_M &&
map[ny + dy[i]][nx + dx[i]] == '.'){
vector<int> newpin;
for (int t = 0; t < pin.size();++t){
if (t == n || (pin[t] / MAX_M == ny && pin[t] % MAX_M == nx)) continue;
newpin.push_back(pin[t]);
}
newpin.push_back((ny + dy[i]) * MAX_M + nx + dx[i]);
sort(newpin.begin(), newpin.end());
if (visit.find(newpin) == visit.end()){
q.push(newpin);
visit.insert(newpin);
}
}
}
}
}
}
move++;
}
return ans;
}
int main(){
int T;
scanf("%d", &T);
while (T--){
ans = INF;
fill(buf, buf + MAX_N*MAX_M, INF);
vector<int> pin;
for (int n = 0; n < MAX_N; n++){
for (int m = 0; m < MAX_M; m++){
scanf(" %1c", &arr[n][m]);
if (arr[n][m] == 'o')
pin.push_back( n * MAX_M + m);
}
}
int ret = bfs(pin);
printf("%d %d\n", ret, buf[ret]);
}
return 0;
}
| cs |
