๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ด๐ป/[๐๐ฒ๐ญ๐ก๐จ๐ง] ๐๐ฅ๐ ๐จ๐ซ๐ข๐ญ๐ก๐ฆ
[Python] ๋ฐฑ์ค 5014 & ํ๋ก๊ทธ๋๋จธ์ค ์คํ์ฑํ ๋ฐฉ
๐คRyusun๐ค
2023. 7. 31. 14:24
#5012 ์คํํธ๋งํฌ
# ์ด F์ธต
# ์คํํธ๋งํฌ G์ธต
# ํ์ฌ ๊ฐํธ S์ธต
# U๋ ์๋ก u์ธต
# D๋ ์๋๋ก d์ธต
F, S, G, U, D = map(int, input().split())
visited = [-1] * (F + 1)
from collections import deque
def bfs():
q = deque()
q.append(S)
visited[S] = 0
while q:
x = q.popleft()
if x == G:
return visited[x]
for nx in (x+U, x-D):
if 1 <= nx <= F and visited[nx] == -1:
q.append(nx)
visited[nx] = visited[x] + 1
return "use the stairs"
print(bfs())
record = ["Enter uid1234 Muzi", "Enter uid4567 Prodo","Leave uid1234","Enter uid1234 Prodo","Change uid4567 Ryan"]
def solution(record):
memo = {}
answer = []
for message in record:
info = message.split()
if info[0] == "Enter" or info[0] == "Change":
memo[info[1]] = info[2]
for id in record:
info = id.split()
if info[0] == "Enter":
answer.append(memo[info[1]]+"๋์ด ๋ค์ด์์ต๋๋ค.")
elif info[0] == "Leave":
answer.append(memo[info[1]]+"๋์ด ๋๊ฐ์ต๋๋ค.")
return answer
print(solution(record))
# memo[info[0]] = info[2]