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

J 1060 최소 비용 신장 트리 #5

Open

2 tasks

sanhaa opened this issue Apr 12, 2021 · 1 comment

Labels

other way problem solving

Owner

sanhaa commented Apr 12, 2021 •

edited

Loading

STL vector, queue 안 쓰고 풀기 (구현해 놓은 heap 사용)
배운 prim 알고리즘은 처음부터 queue에 넣던데 그러면 값 변동 될 때 업데이트 어떻게?

sanhaa added other way problem solving labels

Owner Author

sanhaa commented Apr 13, 2021

그리고 인접 배열 말고

인접 리스트 사용해서 BOJ 1197 풀기: https://www.acmicpc.net/problem/1197
(인접 배열 쓰면 메모리 초과 남)

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