結果

問題 No.1602 With Animals into Institute 2
ユーザー shotoyoo
提出日時 2021-07-03 18:09:35
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,357 bytes
コンパイル時間 212 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 265,472 KB
最終ジャッジ日時 2024-07-02 02:10:07
合計ジャッジ時間 17,645 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 3
other AC * 6 WA * 2 TLE * 2 -- * 26
権限があれば一括ダウンロードができます

ソースコード

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 depth[rj]<depth[ri]:
            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 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(1<<k, n, 1<<20)
exec(tos)
exec(frms)

### ダイクストラ dijkstra
_val = 1<<20
inf = 10**15
# 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
    vals = [[] for _ in range(n)]
    ds = [[] for _ in range(n)]
    ls = [[] for _ in range(n)]
    h = [to(0, 0, 0, start)] # (距離, ノード番号)
    vals[start].append(0)
    # order = []
    count = 1
    done = [0]*n
    while h:
        val, l, d, u = frm(hpp(h))
        if len(vals[u])>=num or done[u]:
            continue
        if l not in ls[u]:
            if ds[u] and d>2*ds[u][0]:
                done[u] = 1
                continue
            vals[u].append(val)
            ls[u].append(l)
            ds[u].append(d)
        else:
            continue
        # order.append(u)
        for c,x,e,v in ns[u]:
#             if vals[v]>val+d:
#             vals[v] = val+d
            hp(h, to(val+c, l^x, d+1, v))
    return vals, ls
num = 2
vals, ls = dijkstra(n-1, ns)
ans = [inf]*(n-1)
for v in range(n-1):
    for i in range(len(ls[v])):
        if ls[v][i]!=0:
            ans[v] = min(ans[v], vals[v][i])
    if ans[v]==inf:
        ans[v] = -1
write("\n".join(map(str, ans)))
0