結果
| 問題 | No.3810 Binary Shortest Path Query |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-11-20 23:01:10 |
| 言語 | PyPy3 (8.0.1 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 559 ms / 2,000 ms |
| + 270µs | |
| コード長 | 3,282 bytes |
| 記録 | |
| コンパイル時間 | 401 ms |
| コンパイル使用メモリ | 64,316 KB |
| 実行使用メモリ | 129,396 KB |
| 最終ジャッジ日時 | 2026-11-20 23:01:29 |
| 合計ジャッジ時間 | 16,925 ms |
|
ジャッジサーバーID (参考情報) |
judge1_0 / judge5_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO);
LI = lambda v=0: list(map(lambda i: int(i)-v, input().split())); II=lambda : int(input()); SI=lambda c0: [ord(c)-ord(c0) for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
class UF:
# unionfind
def __init__(self, n):
self.n = n
self.parent = list(range(n))
self.size = [1] * n
# self.es = [0] * n
def check(self):
return [self.root(i) for i in range(self.n)]
def root(self, i):
inter = set()
while self.parent[i]!=i:
inter.add(i)
i = self.parent[i]
r = i
for i in inter:
self.parent[i] = r
return r
def merge(self, i, j):
# 繋いだかどうかを返す
ri = self.root(i)
rj = self.root(j)
if ri==rj:
# self.es[ri] += 1
return False
if self.size[ri]>self.size[rj]:
ri,rj = rj,ri
self.parent[ri] = rj
self.size[rj] += self.size[ri]
# self.es[rj] += self.es[ri] + 1
return True
def rs(self):
return sorted(set([self.root(i) for i in range(self.n)]))
def groups(self):
gs = {}
for u in range(self.n):
gs.setdefault(self.root(u), []).append(u)
for item in gs.values():
item.sort()
return gs
n,m,q = list(map(int, input().split()))
uf = UF(n)
s = LI()
ns = [[] for _ in range(n)]
INF = 7*(10**18)
for i in range(1,m+1):
u,v,w = LI()
u -= 1
v -= 1
if w==0:
uf.merge(u,v)
continue
if i<90 and (1<<i)*w<INF:
ns[u].append(((1<<i)*w,v))
ns[v].append(((1<<i)*w,u))
gs = uf.groups()
nns = {}
ss = {}
for u in range(n):
ra = uf.root(u)
ss.setdefault(ra, INF)
ss[ra] = min(ss[ra], s[u])
for d,v in ns[u]:
rb = uf.root(v)
nns.setdefault(ra, []).append((d, rb))
### ダイクストラ dijkstra
_val = 1<<20
inf = INF
def to(d,u):
return d*_val+u
def frm(val):
return divmod(val,_val)
def dijkstra(start,ns):
from heapq import heappop as hpp, heappush as hp
n = len(ns)
vals = {}
h = [to(0, start)] # (距離, ノード番号)
vals[start] = 0
# order = []
while h:
val, u = frm(hpp(h))
if val>vals[u]:
continue
# order.append(u)
for d,v in ns.get(u, []):
if v not in vals or vals[v]>val+d:
vals[v] = val+d
hp(h, to(vals[v], v))
return vals #, order
for i in range(q):
a,b = LI(1)
ra = uf.root(a)
rb = uf.root(b)
da = dijkstra(ra,nns)
db = dijkstra(rb,nns)
ba = bb = INF
for ru,val in da.items():
ba = min(ba, val+ss[ru])
for ru,val in db.items():
bb = min(bb, val+ss[ru])
res = ba+bb
if rb in da:
res = min(res, da[rb])
print(res)