結果
| 問題 | No.1602 With Animals into Institute 2 |
| ユーザー |
 shotoyoo
|
| 提出日時 | 2021-06-19 16:08:54 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 3,482 bytes |
| コンパイル時間 | 307 ms |
| コンパイル使用メモリ | 87,132 KB |
| 実行使用メモリ | 457,520 KB |
| 最終ジャッジ日時 | 2023-09-14 19:04:24 |
| 合計ジャッジ時間 | 7,421 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 76 ms
75,632 KB |
| testcase_01 | AC | 75 ms
71,248 KB |
| testcase_02 | TLE | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
ソースコード
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))
class UF:
# unionfind
def __init__(self, n):
self.n = n
self.parent = list(range(n))
self.size = [1] * 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 connect(self, i, j):
# 繋いだかどうかを返す
ri = self.root(i)
rj = self.root(j)
if ri==rj:
return False
if self.size[ri]<self.size[rj]:
self.parent[ri] = rj
self.size[rj] += self.size[ri]
else:
self.parent[rj] = ri
self.size[ri] += self.size[rj]
return True
# グラフの読み込み・重みあり
inf = 10**16
n,m,k = map(int, input().split())
ns = [[] for _ in range(n)]
ans = [-1]*n
h = []
q = [inf]*n
parent = list(range(n))
uf = UF(n)
d = [-1]*n
l = [-1]*n
es = []
for e in range(m):
u,v,c,x = input().split()
u = int(u)
v = int(v)
c = int(c)
x = int(x, 2)
u -= 1
v -= 1
ns[u].append((c,x,e,v))
ns[v].append((c,x,e,u))
es.append((u,v,c,x))
### ダイクストラ dijkstra
_val = 1<<20
def to(d,u):
return d*_val+u
def frm(val):
return divmod(val,_val)
def dijkstra(start,ns):
import heapq
vals = [inf] * n
h = [to(0, start)] # (距離, ノード番号)
vals[start] = 0
ps = [-1]*n
ps[start] = (-1,-1,start)
# order = []
while h:
val, u = frm(heapq.heappop(h))
if val>vals[u]:
continue
# order.append(u)
for d,x,e,v in ns[u]:
if vals[v]>val+d:
vals[v] = val+d
heapq.heappush(h, to(vals[v], v))
ps[v] = (d,x,u)
return vals, ps
vals, ps = dijkstra(n-1, ns)
ns2 = [[] for _ in range(n)]
for i,(dd,x,v) in enumerate(ps[:-1]):
ns2[i].append((dd,x,v))
ns2[v].append((dd,x,i))
qq = [n-1]
d[n-1] = 0
l[n-1] = 0
depth = [0]*n
while qq:
u = qq.pop()
for dd,x,v in ns2[u]:
if d[v]>=0:
continue
d[v] = d[u] + dd
l[v] = l[u] ^ x
depth[v] = depth[u] + 1
qq.append(v)
from heapq import heappop as hpp, heappush as hp, heapify
hbest = [inf]*m
for e,(u,v,c,x) in enumerate(es):
if l[u]^x!=l[v]:
h.append((d[u]+d[v]+c, e))
heapify(h)
while h:
val, e = hpp(h)
if val>=inf:
break
if val>hbest[e]:
continue
hbest[e] = val
u,v,c,x = es[e]
w1 = uf.root(u)
w2 = uf.root(v)
b = []
while w1!=w2:
if depth[w1]<=depth[w2]:
b.append(w2)
w2 = uf.root(ps[w2][2])
else:
b.append(w1)
w1 = uf.root(ps[w1][2])
for ww in b:
uf.connect(w1,ww)
# q[ww] = min(q[ww], val - d[w1])
q[ww] = val - d[ww]
for cc,xx,ee,vv in ns[ww]:
val2 = q[ww] + d[vv] + cc
if val2<hbest[ee]:
hp(h, (val2, ee))
for v in range(n-1):
if l[v]!=0:
ans[v] = d[v]
else:
ans[v] = q[v]
if ans[v]==inf:
ans[v] = -1
write("\n".join(map(str, ans[:-1])))