Home

문제 def solution(k, dungeons): def dfs(k, dungeons, visited): max_count = 0 for i in range(len(dungeons)): if not visited[i] and dungeons[i][0] <= k: visited[i] = True max_count = max(max_count, dfs(k - dungeons[i][1], dungeons, visited) + 1) visited[i] = False ...

문제 class Node(): def __init__(self, value, step, next_node = None, prev_node = None): self.value = value self.step = step self.next_node = next_node self.prev_node = prev_node n = int(input()) move = list(map(int, input().split())) head = Node(1, move[0]) tail = Node(n, move[-1]) cur = head for i in range(2...

문제 class Node(): def __init__(self, value, next_node = None, prev_node = None): self.value = value self.next_node = next_node self.prev_node = prev_node n, m = map(int, input().split()) head = Node(1) tail = Node(n) cur = head for i in range(2, n): new_node = Node(i) cur.next_node = new_node new_node.pr...

문제 class Node(): def __init__(self, value, next_node = None, prev_node = None): self.value = value self.next_node = next_node self.prev_node = prev_node n, m = map(int, input().split()) head = Node(1) tail = Node(n) cur = head for i in range(2, n): new_node = Node(i) cur.next_node = new_node new_node.pr...

문제 from collections import deque n = int(input()) grid = [list(input()) for _ in range(n)] grid_rg = [[('R' if c == 'G' else c) for c in row] for row in grid] def bfs(i, j, grid, color): queue = deque() queue.append((i,j)) visited[i][j] = True cnt = 0 while queue: x, y = queue.popleft() for dx, dy in [(-1, ...