211210 백준 코딩연습 파이썬 2606 바이러스

https://solved.ac/

 

파이썬

 

실3 바이러스

 

https://www.acmicpc.net/problem/2606

 

 

 

import sys
def dfs(graph, root):
    visited[root] = True
    for i in graph[root]:
        if not visited[i]:
            dfs(graph, i)
input = sys.stdin.readline
computer = int(input())
connectedPair = int(input())
graph = {}
for i in range(connectedPair):
    a, b = map(int, input().split())
    try:
        graph[a].append(b)
    except:
        graph[a] = [b]
    try:
        graph[b].append(a)
    except:
        graph[b] = [a]
visited = [False] * (computer + 1)
dfs(graph, 1)
print(visited.count(True) - 1)

 

 

실1 미로 탐색

 

https://www.acmicpc.net/problem/2178

 

 

 

import sys
from collections import deque
input = sys.stdin.readline
N, M = map(int, input().split())
maze = []
for i in range(N):
    maze.append(list(map(int, input().rstrip())))
 
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]
 
visited = []
queue = deque()
queue.append((0, 0))
 
while queue:
    x, y = queue.popleft()
 
    for i in range(4):
        nx = x + dx[i]
        ny = y + dy[i]
 
        if nx >= N or ny >= M or nx < 0 or ny < 0 or maze[nx][ny] == 0:
            continue
        if maze[nx][ny] == 1:
            maze[nx][ny] = maze[x][y] + 1
            queue.append((nx, ny))
 
print(maze[N-1][M-1])