찬민 책 그리디 숙제

cmkim/BaekJoon/백준_2178.py

@@ -0,0 +1,36 @@
+import sys
+input = sys.stdin.readline
+from collections import deque
+n, m = map(int, input().split())  # n이 세로, m이 가로
+
+arr = []
+visited = [[0] * m for _ in range(n)]
+
+dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+
+
+def bfs(x, y, count):
+
+    while q:
+        x, y, count = q.popleft()
+        if x == n - 1 and y == m - 1:
+            print(count)
+            break
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+            if 0 <= nx < n and 0 <= ny < m:
+                if arr[nx][ny] == 1 and visited[nx][ny] == 0:
+                    visited[nx][ny] = 1
+                    q.append((nx, ny, count+1))
+
+for i in range(n):
+    arr.append(list(map(int, list(input().rstrip()))))
+
+
+
+start = (0, 0, 1)
+q = deque()
+q.append(start)
+
+bfs(0, 0, 0)

cmkim/BaekJoon/백준_2980.py

@@ -1,4 +1,4 @@
-N ,L = map(int, input().split())
+N, L = map(int, input().split())
 
 arr =[]
 tr = 0

cmkim/BaekJoon/백준_3061.py

@@ -0,0 +1,59 @@
+T = int(input())
+
+for _ in range(T):
+    n = int(input())
+    arr = [] * (n+1)
+    arr = list(map(int, input().split()))
+
+    left, right = 0, 0
+
+    for i in range(n):
+        for j in range(n):
+            if i+1 == arr[j] and i < j:
+                left = max(left, j-i)
+
+            if i+1 == arr[j] and i > j:
+                right = max(right, i-j)
+
+    if left + right:
+        print(left+right-1)
+    else:
+        print(0)
+
+
+'''
+1 2 3 4 5 
+
+
+1 5 3 4 2
+
+
+
+4 5 3 2 1
+4 3 5 2 1
+3 4 5 2 1
+3 4 2 5 1
+3 2 4 5 1
+2 3 4 5 1
+2 3 4 1 5
+2 3 1 4 5
+2 1 3 4 5
+1 2 3 4 5
+
+4 5 3 2 1
+3 5 4 2 1
+2 5 4 3 1
+1 5 4 3 2
+1 4 5 3 2
+1 3 5 4 2
+1 2 5 4 3
+1 2 4 5 3
+1 2 3 5 4
+1 2 3 4 5
+
+
+
+1 2 3
+ -
+3 2 1
+'''

cmkim/BaekJoon/백준_4963.py

@@ -0,0 +1,36 @@
+from collections import deque
+
+dx, dy = [-1, -1, -1, 0, 0, 1, 1, 1], [-1, 0, 1, -1, 1, -1, 0, 1]
+
+
+while True:
+    w, h = map(int, input().split())
+
+    if w == 0 and h == 0:
+        break
+    else:
+        arr = [[0] * (w+1) for _ in range(h+1)]
+        visited = [[0] * (w+1) for _ in range(h+1)]
+        for i in range(h):
+            arr[i] = list(map(int, input().split()))
+        q = deque()
+        count = 0
+        for row in range(h):
+            for col in range(w):
+                if arr[row][col] == 1 and visited[row][col] == 0:
+
+                    q.append((col, row))
+                    count += 1
+                    visited[row][col] = 1
+
+
+                    while q:
+                        x, y = q.popleft()  # col, row 순서
+                        for index in range(8):
+                            nx = x + dx[index]
+                            ny = y + dy[index]
+                            if 0 <= nx < w and 0 <= ny < h:
+                                if visited[ny][nx] == 0 and arr[ny][nx] == 1:
+                                    visited[ny][nx] = 1
+                                    q.append((nx, ny))
+        print(count)

cmkim/SCOFE_1차테스트_1번.py

@@ -0,0 +1,62 @@
+n = int(input())
+
+arr = [[]*15 for _ in range(n)]
+
+min = '24:60'
+max = '00:00'
+for i in range(n):
+    arr[i] = input()
+
+maxtime = int(max[:2])
+maxmin = int(max[3:5])
+mintime = int(min[:2])
+minmin = int(min[3:5])
+
+starttime = '00:00'
+endtime = '00:00'
+
+for i in range(n):
+
+    stime = int(arr[i][:2])
+    smin = int(arr[i][3:5])
+    etime = int(arr[i][8:10])
+    emin = int(arr[i][11:13])
+
+    if maxtime < stime:            #시작 시간중 가장 큰, 늦은 시간 구하기
+        maxtime = stime
+        maxmin = smin
+
+    elif maxtime == stime and maxmin < smin:
+        maxmin = smin
+
+    if mintime > etime:             #종료 시간중 가장 작은, 빠른 시간 구하기
+        mintime = etime
+        minmin = emin
+
+    elif mintime == etime and minmin > emin:
+        minmin = emin
+
+
+ttime1 = maxtime // 10
+ttime2 = maxtime % 10
+tmin1 = maxmin // 10
+tmin2 = maxmin % 10
+
+starttime = str(ttime1) + str(ttime2) + starttime[2:]
+starttime = starttime[:3] + str(tmin1) + str(tmin2)
+
+ttime1 = mintime // 10
+ttime2 = mintime % 10
+tmin1 = minmin // 10
+tmin2 = minmin % 10
+
+endtime = str(ttime1) + str(ttime2) + endtime[2:]
+endtime = endtime[:3] + str(tmin1) + str(tmin2)
+
+
+if maxtime < mintime:
+    print(starttime, '~', endtime)
+elif maxtime == mintime and maxmin <= minmin:
+    print(starttime, '~', endtime)
+else:
+    print(-1)

cmkim/SCOFE_1차테스트_2번.py

@@ -0,0 +1,29 @@
+n = int(input())
+num = int(input())
+arr = [0]* (n+2)
+flag = 0
+
+for i in range(n):
+    arr[i] = num // (10**(n-i-1))
+    num -= arr[i] * (10**(n-i-1))
+    if flag < arr[i]:
+        flag = arr[i]
+        start = i
+
+dp = [0] * (n+2)
+# dp[0] = arr[0]
+# dp[1] = arr[0]*1
+#print('start = ', start)
+if arr[start+1]:
+    dp[start+1] = arr[start+1]
+if arr[start+2]:
+    dp[start+2] = arr[start+2] + dp[start+1]
+
+for i in range(start+3, n):
+    if arr[i]:
+        dp[i] = dp[i-1] + dp[i-2]
+
+print(dp[n-1])
+
+# print(arr)
+# print(dp)

cmkim/SCOFE_1차테스트_3번.py

@@ -0,0 +1,33 @@
+n = int(input())
+arr = [[0]*(n+1) for _ in range(n+1)]
+dp = [[0]*(n+1) for _ in range(n+1)]
+count = [0] * (n+1)
+for i in range(n):
+    num = int(input())
+    for j in range(n):
+        arr[i][j] = num // (10 ** (n - j - 1))
+        num -= arr[i][j] * (10 ** (n - j - 1))
+
+for i in range(1, n+1):
+    for j in range(1, n+1):
+        dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1] + arr[i-1][j-1]
+
+# print(arr)
+# print(dp)
+
+for size in range(1, n+1):
+    for i in range(size, n + 1):
+        for j in range(size, n + 1):
+            if dp[i][j] - dp[i][j-size] - dp[i-size][j] + dp[i-size][j-size] == size ** 2:
+                count[size] += 1
+
+for i in range (1, n+1):
+    print('size[', i, ']:', count[i])
+
+'''
+4
+1110
+1110
+0110
+0000
+'''

cmkim/SCOFE_1차테스트_4번.py

@@ -0,0 +1,73 @@
+score = [0] * 5
+score = list(map(float, input().split()))
+tempscore = score
+# print(score)
+sorted_score = sorted(score, reverse=True)#score.sort(reverse=True)
+sorted_score_list = [0] * 5
+visited = [0] * 5
+
+for i in range(5):
+    for j in range(5):
+        if sorted_score[i] == tempscore[j]:
+            sorted_score_list[i] = chr(j+65)
+            tempscore[j] += 9999
+            break
+
+
+n, m = map(int, input().split())
+watch = [[]*m for _ in range(n)]
+genre = [[]*m for _ in range(n)]
+
+Y = [[0, 0] for _ in range(n*m)]
+O = [[0, 0] for _ in range(n*m)]
+W = [[0, 0] for _ in range(n*m)]
+ycount = 0
+ocount = 0
+wcount = 0
+
+yprefer = [0] * (n*m)
+oprefer = [0] * (n*m)
+
+
+for i in range(n):
+    watch[i] = list(input())
+
+for i in range(n):
+    genre[i] = list(input())
+
+for i in range(n):
+    for j in range(m):
+        if watch[i][j] == 'Y':
+            Y[ycount] = [i, j]
+            ycount += 1
+        elif watch[i][j] == 'O':
+            O[ocount] = [i, j]
+            ocount += 1
+        elif watch[i][j] == 'W':
+            W[wcount] = [i, j]
+            wcount += 1
+
+
+
+
+for j in range(5):
+    for i in range(ycount):
+        if genre[Y[i][0]][Y[i][1]] == sorted_score_list[j]:
+            yprefer[i] = sorted_score[j]
+for j in range(5):
+    for i in range(ocount):
+        if genre[O[i][0]][O[i][1]] == sorted_score_list[j]:
+            oprefer[i] = sorted_score[j]
+
+for j in range(5):
+    for i in range(ycount):
+        if sorted_score[j] == yprefer[i]:
+            print(genre[Y[i][0]][Y[i][1]], sorted_score[j], Y[i][0], Y[i][1])
+            yprefer[i] += 9999
+
+for j in range(5):
+    for i in range(ocount):
+        if sorted_score[j] == oprefer[i]:
+            print(genre[O[i][0]][O[i][1]], sorted_score[j], O[i][0], O[i][1])
+            oprefer[i] += 9999
+

cmkim/SCOFE_1차테스트_5번.py

@@ -0,0 +1,38 @@
+n, m = map(int, input().split()) # n이 가로, m이 세로 , 가로, 세로 순으로 받는다
+
+arr = [[-1] * n for _ in range(m)]
+
+screen = [0] * m
+start =[0] * n
+sindex = 0
+for i in range(m):
+    screen[i] = input()
+
+for i in range(m):
+    for j in range(n):
+        if screen[i][j] == 'c':
+            arr[i][j] = 0
+            start[sindex] = j
+            sindex += 1
+        elif screen[i][j] == '.':
+            arr[i][j] = 0
+#print(arr)
+
+for i in range(m):
+    for j in range(n):
+        if screen[i][j] == 'c':
+            continue
+        elif screen[i][j] == '.':
+
+
+
+
+
+'''
+4 5
+c.xc
+....
+xx..
+...x
+x..x
+'''