난이도: MediumProblem Description You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. The inputs are generated such that you can reach any intersection from any other intersection and that there is at most one road between any two intersections. You are given an integer n and a 2D integer array roads where roads[i] = [ui,..

BOJ 16236. 아기 상어https://www.acmicpc.net/problem/16236 내 코드import sysfrom collections import dequeinput = sys.stdin.readlinen = int(input())area = []for i in range(n): area.append(list(map(int, input().split()))) for j in range(n): if area[i][j] == 9: start = (i, j) area[i][j] = 0def bfs(start, size): visited = [[0]*n for _ in range(n)] q = deque([start]) ..

BOJ 11660. 구간 합 구하기 5https://www.acmicpc.net/problem/11660  내 코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())board = [list(map(int, input().split())) for _ in range(n)]for i in range(n): for j in range(n): if i == 0 and j == 0: continue elif j == 0: board[i][j] += board[i-1][-1] else: board[i][j] += board[i][j-1]for ..

난이도: HardProblem DescriptionThere is an undirected weighted graph with n vertices labeled from 0 to n - 1. You are given the integer n and an array edges, where edges[i] = [ui, vi, wi] indicates that there is an edge between vertices ui and vi with a weight of wi. A walk on a graph is a sequence of vertices and edges. The walk starts and ends with a vertex, and each edge connects the vertex that..

BOJ 15686. 치킨 배달https://www.acmicpc.net/problem/15686  내 코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())city = []houses = []chicken = []for i in range(n): city.append(list(map(int, input().split()))) for j in range(n): if city[i][j] == 1: houses.append((i, j)) elif city[i][j] == 2: chicken.append((i, j))answer = float('inf')def bac..

BOJ 2096. 내려가기 2096번: 내려가기N줄에 0 이상 9 이하의 숫자가 세 개씩 적혀 있다. 내려가기 게임을 하고 있는데, 이 게임은 첫 줄에서 시작해서 마지막 줄에서 끝나게 되는 놀이이다.먼저 처음에 적혀 있는 세 개의 숫자 중에서www.acmicpc.net   내 코드import sysinput = sys.stdin.readlinen = int(input())dp1 = [0, 0, 0]dp2 = [0, 0, 0]for _ in range(n): nums = (list(map(int, input().split()))) dp1[0], dp1[1], dp1[2] = min(dp1[0], dp1[1]) + nums[0], min(dp1) + nums[1], min(dp1[1], dp1[2..