Merge branch 'main' of https://github.com/JavaJobJava/CodingTest

Author: dia312

.DS_Store

@@ -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/.DS_Store

@@ -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/.DS_Store

@@ -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)
+
+
+
+

syheo/codingTest1/Baekjoon/2178.py

@@ -0,0 +1,38 @@
+
+import sys
+input = sys.stdin.readline
+
+N, time = map(str,input().split())
+N = int(N)
+h = int(time[0:2])
+m = int(time[3:5])
+s = int(time[6:8])
+times = h*60*60+ m*60 + s 
+
+timeList = [0 for _ in range(N)]
+dp= [0 for _ in range(N+1)]
+
+maxSongIdx= -1
+maxSong=-1
+#플레이리스트 입력 
+for i in range(N):
+    tmp = input()
+    timeList[i]=int(tmp[0:2])*60+int(tmp[3:5])
+
+start = 0
+sum = 0
+cnt = 0
+for i in range(N):
+    sum+=timeList[i]
+    cnt+=1
+    if sum >=times:
+        if maxSong<cnt:
+            maxSong = cnt 
+            maxSongIdx = start
+        while sum>=times:
+            sum-=timeList[start]
+            start+=1
+            cnt -= 1
+
+        
+print(maxSong,maxSongIdx+1,end=' ')  

syheo/codingTest1/Baekjoon/3061.py

@@ -0,0 +1,43 @@
+import sys 
+sys.setrecursionlimit(10**7)
+input = sys.stdin.readline
+
+N = int(input())
+
+def find_path(last,visited):
+    if visited == (1<<n)-1:  
+        return info[country[last]][0] or INF  
+    if DP[last][visited] is not None:  
+        return DP[last][visited] 
+    tmp=INF
+    for city in range(n):
+        if visited & (1 << city) == 0 and info[country[last]][city] != 0:
+            tmp=min(tmp,find_path(city,visited|(1<<city)) + info[country[last]][city])
+    DP[last][visited]=tmp
+    return tmp
+
+country = []
+info = dict()
+INF = int(10000)
+
+for i in range(N): 
+    c1, c2,cost = map(str,input().split())
+    if c1 not in info.keys():
+        country.append(c1)
+        info[c1]=[0 for _ in range(6)]
+    if c2 not in info.keys():
+        country.append(c2)
+        info[c2]=[0 for _ in range(6)]
+    info[c1][country.index(c2)]=int(cost)
+    info[c2][country.index(c1)]=int(cost)
+n = len(country)
+
+DP=[[None]*(1<<n) for _ in range(n)]
+
+
+print(find_path(0,1<<0))
+
+
+
+    
+

syheo/codingTest1/Baekjoon/4963.py

@@ -0,0 +1,20 @@
+import re
+
+N = int(input())
+indexList = []
+for i in range(N):
+    indexList.append(input())
+Q = int(input())
+
+for i in range(Q):
+    tmp = input()
+    cnt = 0
+    r = re.compile('.(%s).'%tmp)
+    tmpList = list(filter(r.match, indexList)) 
+    print(tmpList)
+    for j in indexList:
+        match = re.findall(re.escape(tmp), j)
+        #print('match',match)
+        cnt+=len(match)
+    #print(cnt)
+