結果

問題 No.1601 With Animals into Institute
ユーザー shotoyoo
提出日時 2021-06-24 21:24:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,415 ms / 3,000 ms
コード長 2,946 bytes
コンパイル時間 170 ms
コンパイル使用メモリ 82,040 KB
実行使用メモリ 145,664 KB
最終ジャッジ日時 2024-07-02 02:05:17
合計ジャッジ時間 21,684 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

    
n,m = list(map(int, input().split()))
uf = UF(n)
assert all((
    2<=n<=10**5,
    1<=2*10**5,
))
ns = [[] for _ in range(n)]
s = 0
sx = 0
for i in range(m):
    a,b,c,x = map(int, input().split())
    assert all((
        1<=a<=n,
        1<=b<=n,
        a!=b,
        1<=c<=10**9,
        x in (0,1),
    ))
    sx += 1
    a -= 1
    b -= 1
    ns[a].append((c,b,x))
    ns[b].append((c,a,x))
    s += c
    uf.connect(a,b)
assert sx>0 and len(set([uf.root(i) for i in range(n)]))==1

from heapq import heappop as hpp, heappush as hp
def t2i(*vs):
    n = len(vs)
    val = 1
    nvs = [1]
    for v in vs[::-1]:
        val *= v
        nvs.append(val)
    vs = tuple(nvs[::-1])
    def to(*args):
        return sum((v1*v2 for v1,v2 in zip(vs, args)))
    def frm(val):
        res = []
        for v in vs:
            tmp, val = divmod(val, v)
            res.append(tmp)
        return res
    return to,frm
def t2i(*vs):
    n = len(vs)+1
    nvs = [1]
    val = 1
    for v in vs[::-1]:
        val *= v
        nvs.append(val)
    vs = nvs[::-1]
    tos = "def to(%s):\n" % (",".join([f"v{i}" for i in range(n)]))
    tos += "    val = 0\n"
    for i,v in enumerate(vs):
        tos += f"    val += {v} * v{i}\n"
    tos += "    return val"
    frms = f"def frm(val):\n"
    for i in range(n-1):
        frms += f"    v{i},val = divmod(val, {vs[i]})\n"
    frms += "    return %s" % ((", ".join([f"v{i}" for i in range(n-1)]) + ", val"))
    return tos, frms
tos, frms = t2i(n,2)
exec(tos)
exec(frms)
# to,frm = t2i(n,2)
inf = 2*s + 10
vals = [[inf]*n for _ in range(2)]
vals[0][n-1] = 0
q = [to(0, n-1, 0)]
while q:
    d,u,x = frm(hpp(q))
    if vals[x][u]<d:
        continue
    for c,v,xx in ns[u]:
        nx = x|xx
        nd = d+c
        if vals[nx][v]>nd:
            vals[nx][v] = nd
            hp(q, to(nd, v, nx))
ans = vals[1]
write("\n".join(map(str, ans[:n-1])))
0