feat:그래프탐색

Author: Suxxxxhyun

PR-template.md

@@ -1,3 +1,12 @@
+## PR제목
+  처음 문제를 푼 경우,
+    - type1 : [Solved / Failed] PRG_문제명
+    - type2 : [Solved / Failed] PRG_문제명(복습필요)
+      이후 복습을 한경우,
+    - [Solved / Failed] PRG_문제명(복습횟수)
+        - ex) [Solved / Failed] PRG_문제명(2)
+---
+
 ## 문제 및 풀이과정
 
 [문제명]()

Week2/개인/단지번호붙이기/suhyun.java

@@ -1,4 +1,57 @@
 package Week2.개인.단지번호붙이기;
 
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
 public class suhyun {
+
+    static int n, ans = 0;
+    static char[][] graph;
+    static int[][] dir = {{0,1}, {1,0}, {0,-1}, {-1,0}};
+    static List<Integer> houses = new ArrayList<Integer>();
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        n = Integer.parseInt(br.readLine());
+        graph = new char[n][n];
+        for(int i=0; i<n; i++){
+            String str = br.readLine();
+            for(int j=0; j<n; j++){
+                graph[i][j] = str.charAt(j);
+            }
+        }
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                if(graph[i][j] == '1'){
+                    dfs(i,j);
+                    houses.add(ans);
+                    ans = 0;
+                }
+            }
+        }
+        System.out.println(houses.size());
+        Collections.sort(houses);
+        for(int i=0; i<houses.size(); i++){
+            System.out.println(houses.get(i));
+        }
+    }
+
+    static int dfs(int x, int y){
+        ans += 1;
+        graph[x][y] = '0';
+        for(int i=0; i<4; i++){
+            int nx = x + dir[i][0];
+            int ny = y + dir[i][1];
+            if(nx < 0 || ny < 0 || nx >= n || ny >= n){
+                continue;
+            }
+            if(graph[nx][ny] == '1'){
+                dfs(nx, ny);
+            }
+        }
+        return ans;
+    }
 }

Week2/개인/단지번호붙이기/suhyun1.py

@@ -0,0 +1,35 @@
+import sys
+si = sys.stdin.readline
+sys.setrecursionlimit(10000)
+n = int(si())
+graph = [list(map(int, si().strip())) for _ in range(n)]
+dir = [[0,1], [1,0], [0,-1], [-1,0]]
+answer = []
+ans = 0
+
+def dfs(x, y):
+    global ans
+    ans += 1
+    graph[x][y] = 0
+    
+    for i in range(4):
+        nx = x + dir[i][0]
+        ny = y + dir[i][1]
+        
+        if nx < 0 or ny < 0 or nx >= n or ny >= n:
+            continue
+        if graph[nx][ny] == 1:
+            dfs(nx, ny)
+    
+
+for x, row in enumerate(graph):
+    for y, col in enumerate(row):
+        if col == 1:
+            dfs(x, y)
+            answer.append(ans)
+            ans = 0
+
+print(len(answer))
+answer.sort()
+for i in answer:
+    print(i)

Week2/개인/유기농배추/suhyun.java

@@ -1,4 +1,55 @@
 package Week2.개인.유기농배추;
 
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
 public class suhyun {
+
+    static int t, m, n, k, a, b;
+    static StringTokenizer st;
+    static int[][] graph;
+    static int[][] dir = {{0,1}, {1,0}, {0,-1}, {-1,0}};
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        t = Integer.parseInt(br.readLine());
+        for(int i=0; i<t; i++){
+            st = new StringTokenizer(br.readLine(), " ");
+            m = Integer.parseInt(st.nextToken());
+            n = Integer.parseInt(st.nextToken());
+            k = Integer.parseInt(st.nextToken());
+            graph = new int[n][m];
+            for(int j=0; j<k; j++){
+                st = new StringTokenizer(br.readLine(), " ");
+                a = Integer.parseInt(st.nextToken());
+                b = Integer.parseInt(st.nextToken());
+                graph[b][a] = 1;
+            }
+            int ans = 0;
+            for(int x=0; x<graph.length; x++){
+                for(int y=0; y<graph[x].length; y++){
+                    if(graph[x][y] == 1){
+                        dfs(x, y);
+                        ans += 1;
+                    }
+                }
+            }
+            System.out.println(ans);
+        }
+    }
+
+    static void dfs(int x, int y){
+        graph[x][y] = 0;
+        for(int i=0; i<4; i++){
+            int nx = x + dir[i][0];
+            int ny = y + dir[i][1];
+            if(nx < 0 || ny < 0 || nx >= n || ny >= m){
+                continue;
+            }
+            if(graph[nx][ny] == 1){
+                dfs(nx, ny);
+            }
+        }
+    }
 }

Week2/개인/유기농배추/suhyun.py

@@ -1,5 +1,6 @@
 import sys
 si = sys.stdin.readline
+sys.setrecursionlimit(100000)
 
 dir = [[0,1], [1,0], [0,-1], [-1,0]]
 

Week2/개인/유기농배추/suhyun1.py

@@ -0,0 +1,35 @@
+import sys
+sys.setrecursionlimit(100000)
+si = sys.stdin.readline
+t = int(si())
+dir = [[0,1], [1,0], [0,-1], [-1,0]]
+
+def dfs(x, y):
+    graph[x][y] = 0
+    
+    for i in range(4):
+        nx = x + dir[i][0]
+        ny = y + dir[i][1]
+        
+        if nx < 0 or ny < 0 or nx >= n or ny >= m:
+            continue
+        if graph[nx][ny] == 1:
+            dfs(nx, ny)
+    
+
+for i in range(t):
+    m, n, k = map(int, si().split())
+    graph = [[0] * m for _ in range(n)]
+    for j in range(k):
+        y, x = map(int, si().split())
+        graph[x][y] = 1
+    
+    ans = 0
+    for a, row in enumerate(graph):
+        for b, col in enumerate(row):
+            if graph[a][b] == 1:
+                dfs(a, b)
+                # print("a = " + str(a) + ", b = " + str(b))
+                ans += 1
+            # print(graph)
+    print(ans)