장난감 조립 #593

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Merged

jjangsungwon merged 1 commit into CodeTest-StudyGroup:master from JH-TT:BOJ_2637

Nov 13, 2021

Contributor

JH-TT commented Nov 12, 2021

📘 풀이한 문제

백준 2637 - 장난감 조립

⭐ 문제에서 주로 사용한 알고리즘

위상정렬

📜 대략적인 코드 설명

만약 y부품 k개가 x부품이 된다는 정보를 받으면
x의 간선 개수를 1 증가시키고
연결 그래프 정보에 y인덱스에 (x, k)를 넣어준다
간선이 0개인 부품은 deque에 넣고 계속 위상정렬을 돌린다.


          장난감 조립

db9ae57

jjangsungwon added the problem-solved label

jjangsungwon merged commit 88e6982 into CodeTest-StudyGroup:master

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels