목록그래프 탐색 (5)

DevLog:-)

[알고리즘][파이썬]1697-숨바꼭질

문제 코드 import sys from collections import deque n, k = map(int,sys.stdin.readline().strip().split()) def bfs(): q = deque() q.append(n) while q: v = q.popleft() if v == k: print(visited[v]) break for nv in (v - 1, v + 1, v * 2): if 0
알고리즘/백준 2023. 5. 26. 02:16
[알고리즘][파이썬] 2178-미로 탐색

문제 코드 import sys from collections import deque #60m r,c = map(int,sys.stdin.readline().strip().split()) graph = [] visited = [[False]*c for _ in range(r)] for _ in range(r): graph.append(list(map(int,sys.stdin.readline().strip()))) dx =[1,-1,0,0] dy =[0,0,1,-1] visited[0][0]=True q= deque() q.append((0,0,1)) f=0 while(q): cx,cy,count= q.popleft() for i in range(4): nx = cx+dx[i] ny = cy+dy[i] if..
알고리즘/백준 2023. 5. 17. 01:27
[알고리즘][파이]1260-DFS와 BFS ✅

문제 코드 import sys from collections import deque N,M,V = map(int,sys.stdin.readline().strip().split()) graph =[[] for _ in range(N+1)] def dfs(cur_v): visited.append(cur_v) for v in graph[cur_v]: if(v not in visited): dfs(v) return visited def bfs(start_v): visited=[start_v] q = deque() q.append(start_v) while(q): cur_v =q.popleft() for v in graph[cur_v]: if(v not in visited): visited.append(v) q...
알고리즘/백준 2023. 5. 16. 23:25
[알고리즘][파이썬]2606-바이러스

문제코드BFSimport sysfrom collections import dequen = int(sys.stdin.readline())m = int(sys.stdin.readline())graph=[[] for _ in range(n+1)]def bfs(start_v): visited=[start_v] q =deque() q.append(start_v) while(q): cur_v=q.popleft() for v in graph[cur_v]: if(v not in visited): visited.append(v) q.append(v) re..
알고리즘/백준 2023. 5. 16. 23:17
[알고리즘](파이썬)16953-A→B

문제 소스코드 import sys from collections import deque n,b = map(int,sys.stdin.readline().split()) q= deque() q.append([n,1]) #현재 값과 레벨과 넣기 f=0 while(q): k=q[0] if(k[0]==b): #맨 앞에 칸이 b와 같은지 확인 print(k[1]) f=1 break else: q.popleft() #다를 경우 큐에서 빼내고 해당 값에서 파생된 값 갱신 if(k[0]*2
알고리즘/백준 2023. 5. 12. 10:26
이전 Prev 1 Next 다음