Merge pull request #182 from 4RG0S/202302571

202302571_심민우_9주차

Author: Ham3798

202302571/14503_심민우.cpp

@@ -0,0 +1,117 @@
+// 23.08.21
+// BOJ 14503
+// 시뮬레이션
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <string>
+
+using namespace std;
+
+int map[50][50] = { 0, };
+int n, m;
+
+struct Cleaner {
+    int y, x; //현재 위치
+    int d; //바라보는 방향
+
+    int dy = 0, dx = 0; //이동을 했을 시 위치
+
+    int cleancount = 0; //청소하는 횟수
+
+    bool checkiswall() { //벽인지 확인
+        return (dy >= 0) && (dy < n) && (dx >= 0) && (dx < m) && (map[dy][dx] != 1);
+    }
+    void ifforward() { //앞으로 이동할시 좌표 설정
+        if (d == 0) {
+            dy = y - 1;
+            dx = x;
+        }
+        if (d == 1) {
+            dy = y;
+            dx = x + 1;
+        }
+        if (d == 2) {
+            dy = y + 1;
+            dx = x;
+        }
+        if (d == 3) {
+            dy = y;
+            dx = x - 1;
+        }
+    }
+    void ifbackward() { //뒤로 이동할시 좌표 설정
+        if (d == 0) {
+            dy = y + 1;
+            dx = x;
+        }
+        if (d == 1) {
+            dy = y;
+            dx = x - 1;
+        }
+        if (d == 2) {
+            dy = y - 1;
+            dx = x;
+        }
+        if (d == 3) {
+            dy = y;
+            dx = x + 1;
+        }
+    }
+    void movement() { //이동
+        y = dy; x = dx;
+    }
+    void cleaning() { //현재 칸이 아직 청소되지 않은 경우, 현재 칸을 청소
+        if (map[y][x] == 0) {
+            cleancount++;
+            map[y][x] = 2; //청소한 상태
+        }
+    }
+    void rotation() { //반시계 회전
+        d--;
+        if (d == -1)
+            d = 3;
+    }
+    bool checksurround() { //주변 확인
+        for (int i = 0; i < 4; i++) { //반시계로 돔
+            rotation();
+            ifforward();
+            if (checkiswall() && map[dy][dx] == 0) { //앞쪽 칸이 청소되지 않을 경우
+                movement(); 
+                return true;
+            }
+            dy = y; dx = x; //이동하기 전으로 돌려 놓음
+        }
+        return false; //주변 4칸 중 청소되지 않은 빈 칸이 없는 경우
+    }
+};
+
+int main() {
+    ios::sync_with_stdio(false); cin.tie(NULL);
+
+    cin >> n >> m;
+
+    Cleaner cleaner;
+    cin >> cleaner.y >> cleaner.x >> cleaner.d;
+
+    for (int y = 0; y < n; y++)
+        for (int x = 0; x < m; x++)
+            cin >> map[y][x];
+
+    while (true) {
+        cleaner.cleaning();
+
+        if (!cleaner.checksurround()) { //주변 4칸 중 청소되지 않은 빈 칸이 없는 경우
+            cleaner.ifbackward(); //후진 해보고 벽인지 체크
+            if (!cleaner.checkiswall())
+                break;
+
+            cleaner.movement(); //벽이 아니면 이동
+        }
+    }
+
+    cout << cleaner.cleancount;
+
+    return 0;
+}

202302571/16236_심민우.cpp

@@ -0,0 +1,119 @@
+// 23.08.27
+// BOJ 16236
+// 시뮬레이션
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <queue>
+#include <memory.h>
+
+using namespace std;
+
+int map[20][20] = { {0,} };
+int n;
+
+struct Shark {
+    int y, x;
+    int size;
+    int distance = 0;
+    int sizecount = 0;
+
+    Shark(int Y, int X, int Size) : y(Y), x(X), size(Size) {}
+};
+
+bool compdistance(Shark& A, Shark& B) {
+    if (A.distance == B.distance) {
+        if (A.y == B.y)
+            return A.x < B.x;
+        else
+            return A.y < B.y;
+    }
+    else
+        return A.distance < B.distance;
+}
+
+int bfs(const Shark& babyshark, const Shark& edibleshark) {
+    int dy[] = { 0,1,0,-1 };
+    int dx[] = { 1,0,-1,0 };
+
+    bool isvisited[20][20];
+    memset(isvisited, false, sizeof(isvisited));
+
+    queue<pair<Shark,int>> q;
+    q.push({ babyshark,0 });
+    while (!q.empty()) {
+        pair<Shark, int> cur = q.front(); q.pop();
+        int cury = cur.first.y;
+        int curx = cur.first.x;
+
+        if (isvisited[cury][curx])
+            continue;
+        isvisited[cury][curx] = true;
+
+        if (cury == edibleshark.y && curx == edibleshark.x)
+            return cur.second;
+
+        for (int i = 0; i < 4; i++) {
+            int ny = cury + dy[i];
+            int nx = curx + dx[i];
+
+            if (ny < 0 || ny >= n || nx < 0 || nx >= n)
+                continue;
+            if (map[ny][nx] > babyshark.size)
+                continue;
+
+            q.push({ Shark(ny,nx,babyshark.size), cur.second + 1 });
+        }
+    }
+
+    return 9999;
+}
+
+int main() {
+    ios::sync_with_stdio(false); cin.tie(NULL);
+
+    cin >> n;
+
+    Shark babyshark = Shark(0, 0, 2);
+
+    for (int y = 0; y < n; y++) {
+        for (int x = 0; x < n; x++) {
+            cin >> map[y][x];
+            if (map[y][x] == 9) {
+                babyshark.y = y; 
+                babyshark.x = x;
+            }
+        }
+    }
+    int cnt = 0;
+    while (true) {
+        vector<Shark> edibleshark;
+        for (int y = 0; y < n; y++) {
+            for (int x = 0; x < n; x++) {
+                if (map[y][x] != 0 && map[y][x] < babyshark.size && map[y][x] != 9) {
+                    edibleshark.push_back(Shark(y, x, map[y][x]));
+                    edibleshark.back().distance = bfs(babyshark, edibleshark.back());
+                }
+            }
+        }
+        if (edibleshark.empty())
+            break;
+        sort(edibleshark.begin(), edibleshark.end(), compdistance);
+        if (edibleshark.front().distance == 9999)
+            break;
+        cnt += edibleshark.front().distance;
+        if (babyshark.size == ++babyshark.sizecount) {
+            babyshark.size++;
+            babyshark.sizecount = 0;
+        }
+        map[babyshark.y][babyshark.x] = 0;
+        babyshark.y = edibleshark.front().y;
+        babyshark.x = edibleshark.front().x;
+        map[babyshark.y][babyshark.x] = 9;       
+    }
+
+    cout << cnt;
+
+    return 0;
+}