31-9kyo-hwang

9-kyo-hwang/Greedy/2023 KAKAO BLIND RECRUITMENT 미로 탈출 명령어.cpp

@@ -0,0 +1,51 @@
+#include <vector>
+#include <string>
+#include <tuple>
+
+using namespace std;
+
+const vector<tuple<int, int, char>> Offset = {{1, 0, 'd'}, {0, -1, 'l'}, {0, 1, 'r'}, {-1, 0, 'u'}};
+vector<vector<vector<bool>>> Visited;
+
+bool OutOfBound(const int n, const int m, int InX, int InY)
+{
+    return InX < 1 || InX > n || InY < 1 || InY > m;
+}
+
+string Answer = "";
+void DFS(const int n, const int m, const int r, const int c, int InX, int InY, int Remain, string Path = "")
+{
+    if(Remain == 0)
+    {
+        if(InX == r && InY == c)
+        {
+            Answer = Path;
+        }
+        return;
+    }
+
+    Visited[Remain][InX][InY] = true;
+    for(const auto& [Dx, Dy, Dp] : Offset)
+    {
+        int Nx = InX + Dx, Ny = InY + Dy;
+        string NextPath = Path + Dp;
+        int NextRemain = Remain - 1;
+
+        if(!OutOfBound(n, m, Nx, Ny) && !Visited[NextRemain][Nx][Ny])
+        {
+            DFS(n, m, r, c, Nx, Ny, NextRemain, NextPath);
+        }
+
+        if(!Answer.empty())
+        {
+            break;
+        }
+    }
+}
+
+string solution(int n, int m, int x, int y, int r, int c, int k)
+{
+    Visited.assign(k + 1, vector(n + 1, vector(m + 1, false)));
+    DFS(n, m, r, c, x, y, k);
+    return Answer.empty() ? "impossible" : Answer;
+}

9-kyo-hwang/Greedy/23296 엘리베이터 조작.cpp

@@ -17,15 +17,15 @@ int main()
         cin >> A[i];
         NumToComeHere[A[i]] += 1;
     }
-    
+
     vector<int> BtnsToPress;
     auto Move = [&](int Floor = 1)
     {
         while(!IsOutOfHere[Floor])
         {
             IsOutOfHere[Floor] = true;
             int NextFloor = A[Floor];
-            
+
             if(NumToComeHere[NextFloor] > 0)
             {
                 NumToComeHere[NextFloor] -= 1;
@@ -34,7 +34,7 @@ int main()
             }
         }
     };
-    
+
     Move();
 
     for(int Floor = 1; Floor <= N; ++Floor)
@@ -43,25 +43,25 @@ int main()
         {
             continue;
         }
-        
+
         if(NumToComeHere[Floor] == 0)
         {
             BtnsToPress.emplace_back(Floor);
             Move(Floor);
         }
     }
-    
+
     for(int Floor = 1; Floor <= N; ++Floor)
     {
         if(IsOutOfHere[Floor])
         {
             continue;
         }
-        
+
         BtnsToPress.emplace_back(Floor);
         Move(Floor);
     }
-    
+
     cout << BtnsToPress.size() << "\n";
     for(const int& Btn : BtnsToPress)
     {

9-kyo-hwang/README.md

@@ -31,3 +31,4 @@
 | 28차시 | 2024.2.19  | Simulation                 | [SWEA 5644 무선 충전](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRDL1aeugDFAUo&categoryId=AWXRDL1aeugDFAUo&categoryType=CODE&problemTitle=5644&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1)        | [#111](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/111) |
 | 29차시 | 2024.2.22  | Prefix Sum                 | [파괴되지 않은 건물](https://school.programmers.co.kr/learn/courses/30/lessons/92344)        | [#114](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/114) |
 | 30차시 | 2024.2.24  | Greddy                     | [23296 엘리베이터 조작](https://www.acmicpc.net/problem/23296)        | [#115](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/115) |
+| 31차시 | 2024.2.29  | Greddy                     | [미로 탈출 명령어](https://school.programmers.co.kr/learn/courses/30/lessons/150365)        | [#120](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/120) |