結果

問題 No.2955 Pizza Delivery Plan
ユーザー qib
提出日時 2024-12-15 23:59:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 302 ms / 2,000 ms
コード長 1,095 bytes
コンパイル時間 343 ms
コンパイル使用メモリ 82,088 KB
実行使用メモリ 83,584 KB
最終ジャッジ日時 2024-12-15 23:59:56
合計ジャッジ時間 7,698 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import math
INF = 1.0e15
n, k = map(int, input().split())
points = [tuple(map(int, input().split())) for _ in range(n)]
points.append((0, 0))
dist = [[INF for _ in range(n + 1)] for _ in range(n + 1)]
for u in range(n + 1):
xu, yu = points[u]
dist[u][u] = 0
for v in range(u + 1, n + 1):
xv, yv = points[v]
dist[u][v] = dist[v][u] = math.sqrt((xv - xu) ** 2 + (yv - yu) ** 2)
tours = [[INF for _ in range(n + 1)] for _ in range(1 << (n + 1))]
tours[0][n] = 0.0
for mask in range(1 << (n + 1)):
c = sum([(mask >> u) & 1 for u in range(n)])
if c > k:
continue
for cur in range(n + 1):
for nxt in range(n + 1):
if (mask >> nxt) & 1 != 0:
continue
visited = mask | (1 << nxt)
if c < k or (c == k and nxt == n):
tours[visited][nxt] = min(tours[visited][nxt], tours[mask][cur] + dist[cur][nxt])
dp = [INF for _ in range(1 << n)]
dp[0] = 0.0
for mask in range(1, 1 << n):
subset = mask
while subset > 0:
subset = (subset - 1) & mask
dp[mask] = min(dp[mask], dp[subset] + tours[(1 << n) | (mask - subset)][n])
print(dp[-1])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0