67-9kyo-hwang

AlgoLeadMe · Sep 22, 2024 · e172cbf · e172cbf
1 parent 086f215
commit e172cbf
Show file tree

Hide file tree

Showing 2 changed files with 127 additions and 1 deletion.
diff --git a/9-kyo-hwang/Graph Traversal/퍼즐 조각 채우기.cpp b/9-kyo-hwang/Graph Traversal/퍼즐 조각 채우기.cpp
@@ -0,0 +1,125 @@
+#include <string>
+#include <vector>
+#include <functional>
+#include <set>
+
+using namespace std;
+using FPoint = pair<int, int>;
+
+vector<vector<FPoint>> GetBlocksFrom(vector<vector<int>>& Board, bool IsBoard = true)
+{
+    const vector<FPoint> Offset{{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
+    auto OutOfBound = [&](int x, int y)
+    {
+        return x < 0 || x >= Board.size() || y < 0 || y >= Board.size();
+    };
+
+    vector<vector<FPoint>> Blocks;
+
+    function<void(int, int)> DFS = [&](int x, int y)
+    {
+        Blocks.back().emplace_back(x, y);
+        Board[x][y] = (IsBoard ? 1 : 0);
+
+        for(const auto& [dx, dy] : Offset)
+        {
+            int nx = x + dx, ny = y + dy;
+            if(!OutOfBound(nx, ny) && Board[nx][ny] == (IsBoard ? 0 : 1))
+            {
+                DFS(nx, ny);
+            }
+        }
+    };
+
+    for(int i = 0; i < Board.size(); ++i)
+    {
+        for(int j = 0; j < Board.size(); ++j)
+        {
+            if(IsBoard && Board[i][j] == 0
+              || !IsBoard && Board[i][j] == 1)
+            {
+                Blocks.push_back({});
+                DFS(i, j);
+            }
+        }
+    }
+
+    return Blocks;
+}
+
+vector<vector<int>> GetGridFrom(const vector<FPoint>& Block)
+{
+    auto [MinX, MinY] = Block[0];
+    auto [MaxX, MaxY] = Block[0];
+
+    for(const auto& [x, y] : Block)
+    {
+        if(x < MinX) MinX = x;
+        else if(x > MaxX) MaxX = x;
+
+        if(y < MinY) MinY = y;
+        else if(y > MaxY) MaxY = y;
+    }
+
+    vector<vector<int>> Grid(MaxX - MinX + 1, vector<int>(MaxY - MinY + 1, 0));
+    for(const auto& [x, y] : Block)
+    {
+        Grid[x - MinX][y - MinY] = 1;
+    }
+
+    return Grid;
+}
+
+int Rotate(vector<vector<int>>& Grid)
+{
+    vector<vector<int>> Rotated(Grid[0].size(), vector<int>(Grid.size(), 0));
+    int NumCell = 0;
+
+    for(int i = 0; i < Grid.size(); ++i)
+    {
+        for(int j = 0; j < Grid[0].size(); ++j)
+        {
+            if(Grid[i][j] == 1) NumCell++;
+            Rotated[j][Grid.size() - 1 - i] = Grid[i][j];
+        }
+    }
+
+    Grid = Rotated;
+    return NumCell;
+}
+
+int solution(vector<vector<int>> InGameBoard, vector<vector<int>> InTable) 
+{
+    vector<vector<FPoint>> BoardBlocks = GetBlocksFrom(InGameBoard, true);
+    vector<vector<FPoint>> TableBlocks = GetBlocksFrom(InTable, false);
+
+    set<vector<FPoint>> UsedTableBlocks;
+    int Answer = 0;
+
+    for(const vector<FPoint>& BoardBlock : BoardBlocks)
+    {
+        bool IsFilled = false;
+        vector<vector<int>> BoardBlockGrid = GetGridFrom(BoardBlock);
+
+        for(const vector<FPoint>& TableBlock : TableBlocks)
+        {
+            if(IsFilled) break;
+            if(UsedTableBlocks.count(TableBlock)) continue;
+
+            vector<vector<int>> TableBlockGrid = GetGridFrom(TableBlock);
+            for(int i = 0; i < 4; ++i)
+            {
+                int NumCell = Rotate(TableBlockGrid);
+                if(BoardBlockGrid == TableBlockGrid)
+                {
+                    Answer += NumCell;
+                    UsedTableBlocks.emplace(TableBlock);
+                    IsFilled = true;
+                    break;
+                }
+            }
+        }
+    }
+
+    return Answer;
+}
diff --git a/9-kyo-hwang/README.md b/9-kyo-hwang/README.md
@@ -66,4 +66,5 @@
 | 63차시 | 2024.9.3   | Binary Search              | [구간 나누기2](https://www.acmicpc.net/problem/13397)   | [#218](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/218) |
 | 64차시 | 2024.9.8   | Binary Search              | [징검다리](https://school.programmers.co.kr/learn/courses/30/lessons/43236)   | [#221](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/221) |
 | 65차시 | 2024.9.11  | Greedy                     | [디펜스 게임](https://school.programmers.co.kr/learn/courses/30/lessons/142085)   | [#224](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/224) |
-| 66차시 | 2024.9.14  | Sliding Window             | [할인 행사](https://school.programmers.co.kr/learn/courses/30/lessons/131127)   | [#225](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/225) |
+| 66차시 | 2024.9.14  | Sliding Window             | [할인 행사](https://school.programmers.co.kr/learn/courses/30/lessons/131127)   | [#225](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/225) |
+| 67차시 | 2024.9.23  | Graph Traversal            | [할인 행사](https://school.programmers.co.kr/learn/courses/30/lessons/84021)   | [#228](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/228) |