문제 : https://www.acmicpc.net/problem/3190 나의 풀이import sysfrom collections import dequeinput = sys.stdin.readlineN = int(input())K = int(input())apples = [list(map(int, input().split())) for _ in range(K)]L = int(input())rotation = [list(input().split()) for _ in range(L)]board = [[0] * N for _ in range(N)]for a, b in apples: board[a-1][b-1] = 1def bfs(start): dx = [0, 1, 0, -1] dy = [..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/12946 코드def solution(n): result = [] def hanoi(n, start, end, temp): if n == 1: result.append([start, end]) return hanoi(n-1, start, temp, end) result.append([start, end]) hanoi(n-1, temp, end, start) hanoi(n, 1, 3, 2) return result

문제 : https://www.acmicpc.net/problem/15683 나의 풀이import sysinput = sys.stdin.readlinen, m = map(int, input().split())Map = [list(map(int, input().split())) for _ in range(n)]dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]cctv_type = { 1: [[0], [1], [2], [3]], # 상, 하, 좌, 우 2: [[0, 1], [2, 3]], # 상+하, 좌+우 3: [[0, 3], [3, 1], [1, 2], [2, 0]], # 상+우, 우+하, 하+좌, 좌+..

문제 : https://www.acmicpc.net/problem/2252 나의 풀이from collections import dequeimport sysinput = sys.stdin.readlinen, m = map(int, input().split())graph = [[] for _ in range(n+1)]indegree = [0] * (n+1)for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) indegree[b] += 1queue = deque()for i in range(1, n+1): if indegree[i] == 0: queue.append(i)result = []wh..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/17678 코드from collections import dequedef to_minutes(time): h, m = map(int, time.split(":")) return h * 60 + m def to_timestr(minutes): h = minutes // 60 m = minutes % 60 return f"{h:02d}:{m:02d}" def solution(n, t, m, timetable): timetable = sorted([to_minutes(minute) for minute in timetable]) shuttles = [..

문제 : https://www.acmicpc.net/problem/2206 나의 풀이import sysfrom collections import dequeinput = sys.stdin.readlinen, m = map(int, input().split())Map = [list(map(int, input().rstrip())) for _ in range(n)]visited = [[[False] * 2 for _ in range(m)] for _ in range(n)]queue = deque([(0, 0, 0, 1)])visited[0][0][0] = Truedx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]ans = -1while queue: x, y, broken, dist =..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/340198?language=python3 코드def can_place_mat(park, size): rows, cols = len(park), len(park[0]) for i in range(rows - size + 1): for j in range(cols - size + 1): ok = True for x in range(i, i + size): for y in range(j, j + size): if park[x][y] != "-1": ..

문제 : https://www.acmicpc.net/problem/10026 나의 풀이import syssys.setrecursionlimit(10000)input = sys.stdin.readlinen = int(input())grid = [list(input().strip()) for _ in range(n)]visited = [[False] * n for _ in range(n)]dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]def dfs(x, y, color, board): visited[x][y] = True for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0 DFS/BFS로 풀..