#810899 (PyPy3) No.134 走れ！サブロー君

• 問題: No.134 走れ！サブロー君
• ユーザー: SI1000-github
• 提出日時: 2022-10-25 16:33:50
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 164 ms / 5,000 ms
• コード長: 1,390 bytes
• コンパイル時間: 150 ms
• コンパイル使用メモリ: 82,560 KB
• 実行使用メモリ: 80,300 KB
• 最終ジャッジ日時: 2024-07-03 14:55:57
• 合計ジャッジ時間: 1,935 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
other	AC * 15

ソースコード

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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#!/usr/bin/python
# -*- coding: utf-8 -*-
# import
from sys import stdin, setrecursionlimit
setrecursionlimit(10**8)
def int_map():
    return map(float,input().split())
def int_list():
    return list(map(int,input().split()))
def int_mtx(N):
    x = [list(map(int, stdin.readline().split())) for _ in range(N)]
    return x
def str_mtx(N):
    x = [list(stdin.readline()[:-1]) for _ in range(N)]
    return x
def print_space(l):
    return print(" ".join([str(x) for x in l]))
"""    main code    """
x0,y0 = int_map()
N = int(input())
xyw = [[x0,y0,0]]
for _ in range(N):
    x,y,w = int_map()
    xyw.append([x,y,w])
Num = N+1
G = [[] for _ in range(Num)]
for i in range(Num):
    for j in range(i+1,Num):
        G[i].append([j,abs(xyw[i][0]-xyw[j][0]) + abs(xyw[i][1]-xyw[j][1])])
        G[j].append([i,abs(xyw[i][0]-xyw[j][0]) + abs(xyw[i][1]-xyw[j][1])])
        
dp = [[float("INF") for _ in range(Num)] for _ in range(2**Num)]
dp[0][0] = 0
TW = 0
for i in range(Num):
    TW += xyw[i][2]
for s in range(2**Num):
    NW = TW
    for i in range(Num):
        if s >> i & 1 == 1:
            NW -= xyw[i][2]
    for u in range(Num):
        if s >> u & 1 == 1 or s == 0:
            for v,cost in G[u]:
                if s >> v & 1 == 0:
                    dp[s+2**v][v] = min(dp[s+2**v][v] , dp[s][u] + cost*(NW+100)/120 + xyw[v][2])
print(dp[2**Num-1][0])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX