얄루의 개발일기🥑

from collections import deque import sys input = sys.stdin.readline def BFS(): q=deque() q.append([0,0,1]) visited = [[[False]*2 for _ in range(m)] for _ in range(n)] visited[0][0][1] = 1 while q: x,y,c = q.popleft() if x == n-1 and y == m-1: return visited[x][y][c] for i in range(4): nx = x + dx[i] ny = y + dy[i] if 0

DFS를 이용한 풀이 방법(재귀 사용) #DFS로 풀기 import sys input = sys.stdin.readline sys.setrecursionlimit(10000) def DFS(x): visited[x] = True #방문한 곳은 방문처리 해준다. for i in graph[x]: if not visited[i]: DFS(i) n, m = map(int,input().split()) # n-정점 개수 / m - 간선 개수 graph = [[] for _ in range(n+1)] visited = [False] * (n+1) cnt = 0 for i in range(m): u, v = map(int,input().split()) graph[u].append(v) graph[v].append(..

from collections import deque def BFS(): q = deque() q.append(n) #현재 수빈이의 위치를 넣어서 확인해줘야 한다. while q: x = q.popleft() if x == k: print(time[x]) return for next_step in (x-1, x+1, x*2): if 0

from collections import deque def bfs(y, x): q = deque() q.append((y, x)) graph[y][x] = 0 while q: y, x = q.popleft() for dy, dx in d: Y, X = y+dy, x+dx if (0

from collections import deque import sys input = sys.stdin.readline n, m = map(int, input().split()) p = list(map(int, input().split())) dq = deque([i for i in range(1, n+1)]) cnt = 0 for i in p: while True: if dq[0] == i: dq.popleft() break else: if dq.index(i) < len(dq)/2: while dq[0] != i: dq.append(dq.popleft()) cnt += 1 else: while dq[0] != i: dq.appendleft(dq.pop()) cnt += 1 print(cnt) 덱에 ..

from collections import deque import sys input = sys.stdin.readline t = int(input()) for _ in range(t): p =list(input().rstrip()) n = int(input()) x = deque(input().rstrip()[1:-1].split(",")) flag = 0 #입력받을 수가 0인 경우 빈 리스트를 반환 if n == 0: x = deque() for i in p: if i =="R": x.reverse() elif i == "D": if x: x.popleft() else: print("error") flag = 1 break if flag == 0: print("["+",".join(x)+"]") # 뒤..

from collections import deque import sys input = sys.stdin.readline n = int(input()) dq = deque() for _ in range(n): command = list(input().split()) if command[0] == 'push_front': dq.appendleft(command[1]) elif command[0] =='push_back': dq.append(command[1]) elif command[0] =='pop_front': if len(dq) > 0: print(dq.popleft()) else: print(-1) elif command[0] =='pop_back': if len(dq) > 0: print(dq.p..

from collections import deque import sys input = sys.stdin.readline t = int(input()) for _ in range(t): n, m = map(int,input().split()) q = deque(list(map(int,input().split()))) cnt = 0 while q: maxQ = max(q) front = q.popleft() m -= 1 if maxQ == front: cnt += 1 if m < 0 : print(cnt) break else: q.append(front) if m < 0 : m = len(q) - 1 # m이 0보다 작아지는 경우는 그 위치만큼 q를 돌려서 확인했다는 것이기 때문에 m < 0 일때 cnt ..

n = int(input()) p = [0] + list(map(int,input().split())) dp = [0 for _ in range(n+1)] for i in range(1,n+1): for j in range(1,i+1): dp[i] = max(dp[i],dp[i-j]+p[j]) print(dp[i])

import sys input = sys.stdin.readline def solution(n): if n == 1: return 1 elif n == 2: return 2 elif n == 3: return 4 else: return solution(n-1)+solution(n-2)+solution(n-3) t = int(input()) for _ in range(t): print(solution(int(input())))