Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
HYUNAHSHIM
algorithmProblem
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
algorithmProblem
/
BaekJoon2098.py
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
48 lines (39 loc) · 1.66 KB
master
Breadcrumbs
algorithmProblem
/
BaekJoon2098.py
Copy path
Top
File metadata and controls
Code
Blame
48 lines (39 loc) · 1.66 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# BaekJoon 2098
# 입력값 초기화 & 배열 설정
N
=
int
(
input
())
W
=
[[]
for
_
in
range
(
N
)]
dp
=
[[
0
for
_
in
range
(
1
<<
N
-
1
)]
for
_
in
range
(
N
)]
for
i
in
range
(
N
):
W
[
i
]
=
list
(
map
(
int
,
input
().
split
()))
# 현재 위치 i, 지금까지 방문한 도시들의 집합 route일 때 최소 비용 구하는 함수
def
solution
(
i
,
route
):
global
N
,
W
,
dp
# 이미 방문한 경로면 memoization 해둔 값이므로 return
if
dp
[
i
][
route
]
!=
0
:
return
dp
[
i
][
route
]
# 모든 도시를 다 방문한 경우
if
route
==
(
1
<<
(
N
-
1
))
-
1
:
# 마지막 위치에서 0번 도시로 가는 경로가 없는 경우
if
not
W
[
i
][
0
]:
return
float
(
'inf'
)
# 마지막 위치에서 0번 도시로 가는 경로가 있는 경우 정답 반환
else
:
return
W
[
i
][
0
]
# 점화식을 토대로, 최소값을 찾아서 다음 방문 도시 선택하기
min_price
=
float
(
'inf'
)
for
j
in
range
(
1
,
N
):
# i번째 도시에서 j번째 도시로 가는 경로가 없는 경우
if
not
W
[
i
][
j
]:
continue
# j번째 도시가 이미 방문한 도시인 경우
if
route
&
(
1
<<
j
-
1
):
continue
# j번째 도시를 방문했을 경우 비용 계산해서 최소값이면 선택
# i -> j 도시 가는 비용 + solution(j번째 도시, j번째 도시를 추가한 경로)
dist
=
W
[
i
][
j
]
+
solution
(
j
,
route
|
(
1
<<
(
j
-
1
)))
if
min_price
>
dist
:
min_price
=
dist
dp
[
i
][
route
]
=
min_price
return
min_price
# 0번째 도시에서 출발, 아무 도시도 방문하기 않았기 때문에 0
print
(
solution
(
0
,
0
))
You can’t perform that action at this time.