[삼성 SW 역량 테스트] 구슬탈출2

?

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

#include <stdio.h> #include <queue> #include <algorithm> using namespace std;   struct INFO {     int ry, rx, by, bx, count; };   INFO start; char map[10][11];   int bfs() {     const int dy[] = { -1, 1, 0, 0 };     const int dx[] = { 0, 0, -1, 1 };       int visited[10][10][10][10] = { 0, };     queue<INFO> q;     q.push(start);     visited[start.ry][start.rx][start.by][start.bx] = 1;           int ret = -1;     while (!q.empty()) {         INFO cur = q.front();   q.pop();         if (cur.count > 10)  break;         if (map[cur.ry][cur.rx] == 'O' && map[cur.by][cur.bx] != 'O') {             ret = cur.count;             break;         }           for (int dir = 0; dir < 4; ++dir) {             int next_ry = cur.ry;             int next_rx = cur.rx;             int next_by = cur.by;             int next_bx = cur.bx;               while (1) {                 if (map[next_ry][next_rx] != '#' && map[next_ry][next_rx] != 'O') {                     next_ry += dy[dir], next_rx += dx[dir];                 }                 else {                     if (map[next_ry][next_rx] == '#') {                         next_ry -= dy[dir], next_rx -= dx[dir];                     }                     break;                 }             }               while (1) {                 if (map[next_by][next_bx] != '#' && map[next_by][next_bx] != 'O') {                     next_by += dy[dir], next_bx += dx[dir];                 }                 else {                     if (map[next_by][next_bx] == '#') {                         next_by -= dy[dir], next_bx -= dx[dir];                     }                     break;                 }             }               if (next_ry == next_by && next_rx == next_bx) {                 if (map[next_ry][next_rx] != 'O') {                     int red_dist = abs(next_ry - cur.ry) + abs(next_rx - cur.rx);                     int blue_dist = abs(next_by - cur.by) + abs(next_bx - cur.bx);                     if (red_dist > blue_dist) {                         next_ry -= dy[dir], next_rx -= dx[dir];                     }                     else {                         next_by -= dy[dir], next_bx -= dx[dir];                     }                 }             }               if (visited[next_ry][next_rx][next_by][next_bx] == 0) {                 visited[next_ry][next_rx][next_by][next_bx] = 1;                 INFO next;                 next.ry = next_ry;                 next.rx = next_rx;                 next.by = next_by;                 next.bx = next_bx;                 next.count = cur.count + 1;                 q.push(next);             }         }     }     return ret; }   int main() {     int n, m;     scanf("%d %d", &n, &m);     for (int i = 0; i < n; ++i) {         scanf("%s", map[i]);     }       for (int y = 0; y < n; ++y) {         for (int x = 0; x < m; ++x) {             if (map[y][x] == 'R') {                 start.ry = y, start.rx = x;             }             if (map[y][x] == 'B') {                 start.by = y, start.bx = x;             }         }     }     start.count = 0;       int ret = bfs();     printf("%d\n", ret);       return 0; }