Merge pull request #581 from gmlrude/main

[박희경] 79차 라이브 코테 제출

Author: eric-hjh

live7/test79/문제1/박희경.py

@@ -0,0 +1,34 @@
+import sys
+
+input = sys.stdin.readline
+grid = [list(map(str, input().split())) for _ in range(5)]
+
+result = set()
+
+
+def dfs(a, b, num):
+    if len(num) == 6:
+        result.add(num)
+        return
+
+    dx = [-1, 1, 0, 0]
+    dy = [0, 0, -1, 1]
+    for i in range(4):
+        nx, ny = a + dx[i], b + dy[i]
+        if 0 <= nx < 5 and 0 <= ny < 5:
+            dfs(nx, ny, num + grid[nx][ny])
+
+
+for i in range(5):
+    for j in range(5):
+        dfs(i, j, grid[i][j])
+
+print(len(result))
+
+"""
+1 1 1 1 1
+1 1 1 1 1
+1 1 1 1 1
+1 1 1 2 1
+1 1 1 1 1
+"""

live7/test79/문제2/박희경.py

@@ -0,0 +1,48 @@
+import sys
+from collections import *
+
+input = sys.stdin.readline
+
+n, m, k = map(int, input().split())
+grid = [['.' for _ in range(m)] for _ in range(n)]
+for _ in range(k):
+    r, c = map(int, input().split())
+    grid[r - 1][c - 1] = '#'
+
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+visited = [[0 for _ in range(m)] for _ in range(n)]
+
+
+def bfs(a, b):
+    size = 1
+    q = deque([(a, b)])
+    visited[a][b] = 1
+    while q:
+        x, y = q.popleft()
+        for i in range(4):
+            nx, ny = x + dx[i], y + dy[i]
+            if 0 <= nx < n and 0 <= ny < m and not visited[nx][ny]:
+                if grid[nx][ny] == '#':
+                    size += 1
+                    visited[nx][ny] = 1
+                    q.append((nx, ny))
+    return size
+
+
+result = 0
+for i in range(n):
+    for j in range(m):
+        if grid[i][j] == '#':
+            result = max(result, bfs(i, j))
+
+print(result)
+
+"""
+3 4 5
+3 2
+2 2
+3 1
+2 3
+1 1
+"""

live7/test79/문제3/박희경.py

@@ -0,0 +1,6 @@
+def solution(msg):
+    answer = []
+    dic = {}
+    for i in range(1,27):
+        dic[chr(i + 64)] = i
+    return answer