#976943 (PyPy3) No.2739 Time is money

• 問題: No.2739 Time is money
• ユーザー: Butterflv
• 提出日時: 2024-04-23 20:14:25
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,801 ms / 2,000 ms
• コード長: 2,213 bytes
• コンパイル時間: 370 ms
• コンパイル使用メモリ: 82,456 KB
• 実行使用メモリ: 203,276 KB
• 最終ジャッジ日時: 2024-11-06 02:30:48
• 合計ジャッジ時間: 24,889 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 2
other	AC * 18

ソースコード

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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
# https://note.nkmk.me/python-union-find/
from collections import defaultdict
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
N, M, X=map(int, input().split())
INPUT=tuple(tuple(map(int, input().split())) for i in range(M))
uf=UnionFind(N)
for elm in INPUT:
  u, v, _, __=elm
  u-=1; v-=1
  uf.union(u, v)
if uf.same(0, N-1)==False: print(-1); exit()
del uf
edge=[[] for i in range(N)]
for elm in INPUT:
  u, v, C, T=elm
  u-=1; v-=1
  edge[u].append((v, C, T))
  edge[v].append((u, C, T))
# 連結 ⇒ 移動可能
import heapq
d=[]
timeMIN=[None for i in range(N)]
heapq.heapify(d)
# 各タプルは (時間, - 残りのお金, 頂点) で入れる
heapq.heappush(d, (0, 0, 0))
while len(d)>0:
  t, mon, v=heapq.heappop(d)
  mon*=(-1)
  if timeMIN[v]==None: timeMIN[v]=t
  else: continue
  for nv, C, T in edge[v]:
    if timeMIN[nv]!=None: continue
    nt=t+T
    nmon=mon-C
    if nmon<0:
      nt+=(abs(nmon)+X-1)//X
      nmon%=X
    heapq.heappush(d, (nt, -nmon, nv))
print(timeMIN[N-1])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX