아...그 뭐였더라..

99클럽 코테 스터디 18일차 TIL + BFS

https://www.acmicpc.net/problem/27971import sysfrom collections import dequeinput = sys.stdin.readlinen,m,a,b = map(int, input().split())dp = [0] * (n+1)visited = [False] * (n+1)for _ in range(m): l,r = map(int, input().split()) for i in range(l, r+1): visited[i] = True # 닫힌구간 방문처리dp[n] = 0q = deque()q.append(n)while q: value = q.popleft() if value == 0: break for i ..

https://school.programmers.co.kr/learn/courses/30/lessons/86971?language=python3 프로그래머스SW개발자를 위한 평가, 교육, 채용까지 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krfrom collections import dequedef bfs(v, n, trees): visited = [False for _ in range(n+1)] que = deque([v]) visited[v] = True cnt = 1 # 이어져있는 전선의 송전탑 개수 while que: now = que.popleft() for nxt in tree..

https://www.acmicpc.net/problem/7569from collections import dequeimport sysinput = sys.stdin.readlinem,n,h = map(int, input().split())tomato = [[list(map(int, input().split())) for _ in range(n)] for _ in range(h)]# for _ in range(h):# for _ in range(n):# tomato.append(list(map(int, input().split())))days = 0dx = [1,-1,0,0,0,0]dy = [0,0,1,-1,0,0]dz = [0,0,0,0,1,-1]visited = [[[False]..

https://www.acmicpc.net/problem/18352from collections import dequeimport sysinput = sys.stdin.readlinen, m, k, x = map(int, input().split())graph = [[] for _ in range(n+1)]distance = [0] * (n+1)visited = [False] * (n+1)answer = []for _ in range(m): a, b = map(int, input().split()) graph[a].append(b)def bfs(v): que = deque() que.append(v) visited[v] = True while que: now ..

https://www.acmicpc.net/problem/7562from collections import dequeimport sysinput = sys.stdin.readlinedx = [1,2,2,1,-1,-2,-2,-1]dy = [2,1,-1,-2,-2,-1,1,2]n = int(input())def bfs(x,y,moveX,moveY): que = deque() que.append([x,y]) #graph[x][y] = 1 while que: a, b = que.popleft() if a == moveX and b == moveY: return graph[a][b] for i in range(8): ..

https://www.acmicpc.net/problem/24444from collections import dequeimport sysinput = sys.stdin.readlinesys.setrecursionlimit(10**7)n, m, r = map(int, input().split())graph = [[] for _ in range(n+1)]visited = [0] * (n+1)seq = 1que = deque()for _ in range(m): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u)def bfs(r): global seq visited[r] = seq seq += 1 q..

코딩테스트 공부하기로 마음먹고 처음 풀어본 문제다. 하지만.. 결과는 처.참.했.다. 검색을 해보니 DFS/BFS 문제로 푼다고 한다. 둘 중 스택을 이용한 DFS로 풀이 하는 것으로 이해했고 풀이했다. 문제 2번째 예시인 numbers가 [4,1,2,1] 인 경우를 생각해봤다. def solution(numbers, target): answer = 0 n = len(numbers) # temp, idx 값을 의미 stack = [[numbers[0], 0], [-1*numbers[0], 0]] while stack: temp, idx = stack.pop() idx += 1 if idx < n: stack.append([temp+numbers[idx], idx]) stack.append([temp-nu..