Merge pull request #527 from gmlrude/main

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

Author: github-actions[bot]

live6/test65/문제1/박희경.py

@@ -0,0 +1,48 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+
+board = []
+for _ in range(n):
+    board.append(list(map(str, input().rstrip())))
+
+
+def counting():
+    max_cnt = 1
+    for i in range(n):
+        cnt_row = cnt_col = 1
+        for j in range(n - 1):
+            # 가로
+            if board[i][j] == board[i][j + 1]:  # 같은 색이면
+                cnt_row += 1
+            else:
+                cnt_row = 1  # 다른 색이면 카운트 다시 시작
+            max_cnt = max(max_cnt, cnt_row)
+
+        for j in range(n - 1):
+            # 세로
+            if board[j][i] == board[j + 1][i]:
+                cnt_col += 1
+            else:
+                cnt_col = 1
+            max_cnt = max(max_cnt, cnt_col)
+    return max_cnt
+
+res = 1
+for i in range(n):
+    for j in range(n - 1):
+        if n > j + 1 and board[i][j] != board[i][j + 1]:
+            # 아래와 교환
+            board[i][j], board[i][j + 1] = board[i][j + 1], board[i][j]
+            res = max(res, counting())
+            # 복구
+            board[i][j], board[i][j + 1] = board[i][j + 1], board[i][j]
+        if n > i + 1 and board[i][j] != board[i + 1][j]:
+            # 왼쪽과 교환
+            board[i][j], board[i + 1][j] = board[i + 1][j], board[i][j]
+            res = max(res, counting())
+            board[i][j], board[i + 1][j] = board[i + 1][j], board[i][j]
+
+print(res)

live6/test65/문제2/박희경.py

@@ -0,0 +1,40 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+schedule = [[0, 0]]
+for _ in range(n):
+    schedule.append(list(map(int, input().split())))
+
+profit = 0
+
+
+def find_max_profit(day, current_profit):
+    global profit
+
+    # n일 넘어가면 최대이익 갱신
+    if day > n:
+        profit = max(profit, current_profit)
+        return
+
+    # 상담하지 않는 경우
+    find_max_profit(day + 1, current_profit)
+
+    if day + schedule[day][0] - 1 <= n:
+        find_max_profit(day + schedule[day][0], current_profit + schedule[day][1])
+
+
+find_max_profit(1, 0)
+print(profit)
+
+"""
+7
+3 10
+5 20
+1 10
+1 20
+2 15
+4 40
+2 200
+"""

live6/test65/문제3/박희경.py

@@ -0,0 +1,17 @@
+def solution(s):
+    s = list(s.rstrip())
+    stack = []
+
+    for alpa in s:
+        if stack:
+            if stack[-1] == alpa:
+                stack.pop()
+            else:
+                stack.append(alpa)
+        else:
+            stack.append(alpa)
+
+    if stack:
+        return 0
+    else:
+        return 1