結果
問題 | No.828 全方位神童数 |
ユーザー | kopricky |
提出日時 | 2019-04-11 20:42:21 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,362 ms / 2,000 ms |
コード長 | 1,811 bytes |
コンパイル時間 | 538 ms |
コンパイル使用メモリ | 10,956 KB |
実行使用メモリ | 72,468 KB |
最終ジャッジ日時 | 2023-09-26 13:54:17 |
合計ジャッジ時間 | 28,712 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
8,100 KB |
testcase_01 | AC | 17 ms
8,152 KB |
testcase_02 | AC | 17 ms
8,152 KB |
testcase_03 | AC | 65 ms
11,632 KB |
testcase_04 | AC | 28 ms
9,000 KB |
testcase_05 | AC | 58 ms
11,300 KB |
testcase_06 | AC | 26 ms
8,964 KB |
testcase_07 | AC | 23 ms
8,820 KB |
testcase_08 | AC | 26 ms
8,768 KB |
testcase_09 | AC | 20 ms
8,552 KB |
testcase_10 | AC | 48 ms
10,508 KB |
testcase_11 | AC | 20 ms
8,600 KB |
testcase_12 | AC | 50 ms
10,780 KB |
testcase_13 | AC | 474 ms
33,064 KB |
testcase_14 | AC | 1,035 ms
59,424 KB |
testcase_15 | AC | 321 ms
26,664 KB |
testcase_16 | AC | 479 ms
34,140 KB |
testcase_17 | AC | 377 ms
28,852 KB |
testcase_18 | AC | 722 ms
44,636 KB |
testcase_19 | AC | 1,322 ms
70,872 KB |
testcase_20 | AC | 864 ms
51,224 KB |
testcase_21 | AC | 1,147 ms
62,948 KB |
testcase_22 | AC | 233 ms
21,520 KB |
testcase_23 | AC | 76 ms
12,416 KB |
testcase_24 | AC | 646 ms
40,920 KB |
testcase_25 | AC | 239 ms
21,992 KB |
testcase_26 | AC | 1,238 ms
66,808 KB |
testcase_27 | AC | 1,031 ms
58,444 KB |
testcase_28 | AC | 1,249 ms
67,008 KB |
testcase_29 | AC | 1,153 ms
63,876 KB |
testcase_30 | AC | 634 ms
40,772 KB |
testcase_31 | AC | 609 ms
39,944 KB |
testcase_32 | AC | 1,279 ms
66,688 KB |
testcase_33 | AC | 1,348 ms
71,788 KB |
testcase_34 | AC | 1,030 ms
59,040 KB |
testcase_35 | AC | 677 ms
42,852 KB |
testcase_36 | AC | 844 ms
50,904 KB |
testcase_37 | AC | 529 ms
36,436 KB |
testcase_38 | AC | 778 ms
46,880 KB |
testcase_39 | AC | 1,235 ms
67,112 KB |
testcase_40 | AC | 535 ms
36,364 KB |
testcase_41 | AC | 430 ms
31,720 KB |
testcase_42 | AC | 1,362 ms
72,468 KB |
testcase_43 | AC | 828 ms
68,132 KB |
testcase_44 | AC | 325 ms
31,664 KB |
testcase_45 | AC | 489 ms
43,616 KB |
ソースコード
import sys MOD = 1000000007 class UnionFind: def __init__(self, node_size): self._node = node_size self.par = [i for i in range(self._node)] self.rank = [0] * self._node def find(self, ver): if self.par[ver] == ver: return ver else: self.par[ver] = self.find(self.par[ver]) return self.par[ver] def unite(self, ver1, ver2): ver1, ver2 = self.find(ver1), self.find(ver2) if ver1 == ver2: return if self.rank[ver1] < self.rank[ver2]: ver1, ver2 = ver2, ver1 self.par[ver2] = ver1 if self.rank[ver1] == self.rank[ver2]: self.rank[ver1] += 1 def same(self, ver1, ver2): return self.find(ver1) == self.find(ver2) def dfs(u): head = 1 stack[0], stack[1] = -1, u while head > 0: cur, prv, depth = stack[head], stack[head-1], head if visit[cur] == 0: ans[cur] += depth if visit[cur] == len(graph[cur]): head -= 1 continue head += 1 stack[head] = graph[cur][visit[cur]] visit[cur] += 1 if __name__ == '__main__': n = int(sys.stdin.readline()) G, graph = [[] for _ in range(n)], [[] for _ in range(n)] ver, visit, stack = [0]*n, [0]*n, [0]*(n+1) ans = list(map(int, sys.stdin.readline().split())) for i in range(n-1): u, v = map(int, sys.stdin.readline().split()) if u > v: u, v = v, u G[v-1].append(u-1) ver[i+1] = i+1 uf = UnionFind(n) for i in range(n): for v in G[i]: graph[i].append(ver[uf.find(v)]), uf.unite(i, v) ver[uf.find(i)] = i dfs(n-1) ret = 1 for i in range(n): ret = ret * ans[i] % MOD print(ret)