승연 백준 숙제 (#49)

* 5557

* 16953

* 1012

* 2644

* 11909

* 11909,11909-2 fix

* 그래프 이론 실전문제

* 스타트업 코딩 페스티벌 1차

* 5,6

* 3061

* 4963

* 2178

Author: dia312

syheo/codingTest1/Baekjoon/2178.py

@@ -0,0 +1,41 @@
+#solved.ac
+#실버1
+#DFS
+#미로 탈출 
+#2178
+
+#visited는 리스트이므로 mutable한 속성을 갖음 -> 깊은 복사가 필요
+import sys,copy 
+input = sys.stdin.readline
+
+N,M = map(int,input().split())
+
+maps = [] 
+for i in range(N):
+    maps.append(list(map(int,list(input().rstrip()))))
+
+#dfs 
+def dfs(maps,v):
+    cntList = []
+    visited=[[False]*M for _ in range(N)]
+    stack  = [(v[0],v[1],v[2],visited)]
+    while stack:
+        vertex = stack.pop()
+        #예외 처리 
+        if vertex[0]>=0 and vertex[0]<N and vertex[1]>=0 and vertex[1]<M:
+            cnt = vertex[2]
+            row = vertex[0]
+            col = vertex[1]
+            visiting = copy.deepcopy(vertex[3])
+            #방문 가능 여부 판별 
+            if not visiting[row][col] and maps[row][col]==1:
+                if row == N-1 and col == M-1:
+                    cntList.append(cnt)
+                #방문 처리 
+                else:
+                    visiting[row][col]=True
+                    stack.extend([(row+1,col,cnt+1,visiting),(row-1,col,cnt+1,visiting),(row,col+1,cnt+1,visiting),(row,col-1,cnt+1,visiting)])
+    print(min(cntList))
+                
+
+dfs(maps,(0,0,1))

syheo/codingTest1/Baekjoon/3061.py

@@ -0,0 +1,40 @@
+#solved.ac
+#실버4
+#그리디 
+#사다리 타기
+#3061
+import sys 
+input = sys.stdin.readline
+
+cntList = []
+
+#스왑 변형 병합 메서드 
+def swap(array,x,cur,N):
+    if cur<x:
+        array = array[0:cur] + array[cur+1:x+1] + array[cur:cur+1]+ array[x+1:N+1]
+    else: 
+        array = array[0:x] + array[cur:cur+1] + array[x:cur]+array[cur+1:N+1]
+    return array
+
+for i in range(int(input())):
+    N = int(input())
+    #도착점이 index , 시작점이 value 
+    arr = list(map(int,input().split()))
+    arr.insert(0,0)
+    #ladder = [0 for _ in range(N)] 
+    #카운트 변수 
+    cnt = 0
+    #swapping 해서 1번~N번까지 위치를 찾아주며 오름차순 정렬  
+    for j in range(1,N+1):
+        #cur이 j의 위치로 가야 되는 index 값 0  1  6  2 3  4 5 7 
+        cur = arr.index(j)
+        if cur!=j:
+            cnt+=abs(cur-j)
+            arr =swap(arr,j,cur,N)
+            #print(arr)
+    cntList.append(cnt)
+    #print(arr)
+
+for i in cntList:
+    print(i)
+

syheo/codingTest1/Baekjoon/4963.py

@@ -0,0 +1,49 @@
+#solved.ac
+#실버2
+#BFS
+#섬의 개수
+#4963
+
+#인접 행렬 방식으로 풀이
+
+from collections import deque
+import sys 
+input = sys.stdin.readline
+cntList = []
+while True:
+    w,h = map(int,input().split()) #가로 세로 
+    if w ==0 and h==0: 
+        break
+    #맵 생성
+    maps=[[0]*(w+2)]
+    for i in range(h):
+        tmp=[0]+list(map(int,input().split()))+[0]
+        maps.append(tmp)
+    maps.append([0]*(w+2))
+    #BFS
+    visited = [[False]*(w+2) for _ in range(h+2)]  
+    q = deque([])
+    cnt = 0
+    for i in range(1,h+1):
+        for j in range(1,w+1):
+            if not visited[i][j] and maps[i][j]==1:
+                q.append((i,j))
+                visited[i][j]=True
+                while q:
+                    v = q.popleft()
+                    for x in range(-1,2,1):
+                        for y in range(-1,2,1):
+                            vr = v[0]+x
+                            vc = v[1]+y
+                            if not visited[vr][vc] and maps[vr][vc]==1:
+                                q.append((vr,vc))
+                                visited[vr][vc]=True
+                cnt+=1
+    cntList.append(cnt)
+#출력 
+for cnt in cntList:
+    print(cnt)
+
+
+
+