newhaneul

본 포스팅은 Do it! 알고리즘 코딩테스트: C++편을 토대로 공부한 내용을 정리하기 위한 포스팅입니다.https://github.com/KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp GitHub - KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp: Do it! 알고리즘 코딩 테스트: C++편Do it! 알고리즘 코딩 테스트: C++편. Contribute to KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp development by creating an account on GitHub.github.com 8-1 그래프의 표현 Edge List Edge List는 Edge를 중심..

본 포스팅은 Do it! 알고리즘 코딩테스트: C++편을 토대로 공부한 내용을 정리하기 위한 포스팅입니다.https://github.com/KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp GitHub - KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp: Do it! 알고리즘 코딩 테스트: C++편Do it! 알고리즘 코딩 테스트: C++편. Contribute to KwonKiHyeok/Do_it_Alogrithm_Coding_Test_with_Cpp development by creating an account on GitHub.github.com 너비 우선 탐색(Breadth-First Search)  너비 우선 탐색(Br..

# Baekjoon 10026번: 적록색약import syssys.setrecursionlimit(10**9)from collections import dequeinput = sys.stdin.readlineN = int(input())painting = [[] for _ in range(N)]nor_visited = [[] for _ in range(N)]abnor_visited = [[] for _ in range(N)]normal, abnormal = 0, 0for i in range(N): paint = input().rstrip() for j in paint: painting[i].append(j) nor_visited[i].append(0) ab..

# Baekjoon 16928번: 뱀과 사다리 게임 import sys from collections import deque input = sys.stdin.readline N, M = map(int, input().split()) visited = [0 for _ in range(101)] ladder = [tuple(map(int, input().split())) for _ in range(N)] snake = [tuple(map(int, input().split())) for _ in range(M)] visited_ladder = [None for _ in range(101)] visited_snake = [None for _ in range(101)] for x, y in ladder: visi..

# Baekjoon 14940번: 쉬운 최단거리 import sys from collections import deque input = sys.stdin.readline n, m = map(int, input().split()) arr = [] sol_arr = [[None] * m for _ in range(n)] des_x, des_y = -1, -1 for i in range(n): distance = list(map(int, input().split())) arr.append(distance) for j in range(m): if distance[j] == 2: des_x = j des_y = i elif distance[j] == 0: sol_arr[i][j] = 0 def BFS(): sol..

# Baekjoon 11724번: 연결 요소의 개수 import sys from collections import deque input = sys.stdin.readline N, M = map(int, input().split()) visited = [None for _ in range(N+1)] graph = [[] for _ in range(N+1)] cnt = 0 for i in range(M): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u) def BFS(i): global cnt q = deque() q.append(graph[i]) visited[i] = True while q: for v in q.popleft(..

# Baekjoon 2178번: 미로 탐색 import sys from collections import deque input = sys.stdin.readline N, K = map(int, input().split()) maze = [[] for _ in range(N)] visited = [[] for _ in range(N+1)] for i in range(N): for j in range(K): visited[i].append(0) for i in range(N): maze_num = input() for j in maze_num: maze[i].append(j) def BFS(): visited[0][0] = 1 queue = deque() queue.append((0, 0)) while qu..

# Baekjoon 1697번: 숨바꼭질 import sys from collections import deque input = sys.stdin.readline N, K = map(int, input().split()) visited = [0] * 2000002 def BFS(pos): queue = deque() queue.append(pos) visited[N] = 1 while queue: c = queue.popleft() if c == K: return visited[c]-1 for i in (c-1, c+1, 2*c): if visited[i] == 0 and 0