結果

問題 No.3079 Unite Japanese Prefectures
ユーザー tassei903
提出日時 2025-03-28 23:26:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 848 ms / 4,000 ms
コード長 2,593 bytes
コンパイル時間 318 ms
コンパイル使用メモリ 82,612 KB
実行使用メモリ 149,384 KB
最終ジャッジ日時 2025-03-28 23:26:35
合計ジャッジ時間 9,178 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

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())

r = 6
n, m = na()

uf = UnionFind(n)
e = [[] for i in range(r)]
for _ in range(m):
    u, v, w = na()
    u -= 1
    v -= 1
    w -= 1
    e[w].append((u, v))

A = [0] * r
for i in range(r):
    for u, v in e[i]:
        if not uf.same(u, v):
            uf.union(u, v)
            A[i] += 1

def f(a):
    s = 0
    for i in range(6):
        s = s * (A[i] + 1) + a[i]
    # print(a, s)
    return s

from collections import defaultdict
dp = defaultdict(int)

from itertools import product
dp[f([0] * 6)] = 0
# print(A)
for p in product(*[range(A[i] + 1) for i in range(r)]):
    if p == (0,) * r:
        continue
    j = -1
    X = f(p)
    c = 0
    z = 0
    for i in range(r):
        if p[i]:
            j = i
        if j != -1:
            np = p[:j] + (p[j]-1, ) + p[j+1:]
            Y = f(np)
            c += 1
            z += dp[Y]
    
    dp[X] = (z + 6) / c
#     print(p, dp[X], z, c)

# print(A)
print(dp[f(A)])
0