結果
問題 | No.827 総神童数 |
ユーザー | maspy |
提出日時 | 2020-02-29 00:29:08 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 937 ms / 2,000 ms |
コード長 | 1,406 bytes |
コンパイル時間 | 651 ms |
コンパイル使用メモリ | 10,944 KB |
実行使用メモリ | 85,144 KB |
最終ジャッジ日時 | 2023-08-03 22:24:51 |
合計ジャッジ時間 | 24,115 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 185 ms
45,308 KB |
testcase_01 | AC | 189 ms
45,336 KB |
testcase_02 | AC | 190 ms
45,120 KB |
testcase_03 | AC | 190 ms
45,220 KB |
testcase_04 | AC | 190 ms
45,072 KB |
testcase_05 | AC | 188 ms
45,340 KB |
testcase_06 | AC | 187 ms
45,284 KB |
testcase_07 | AC | 190 ms
45,292 KB |
testcase_08 | AC | 189 ms
45,084 KB |
testcase_09 | AC | 875 ms
85,144 KB |
testcase_10 | AC | 412 ms
58,792 KB |
testcase_11 | AC | 198 ms
45,904 KB |
testcase_12 | AC | 272 ms
50,976 KB |
testcase_13 | AC | 740 ms
77,560 KB |
testcase_14 | AC | 200 ms
46,480 KB |
testcase_15 | AC | 378 ms
57,692 KB |
testcase_16 | AC | 740 ms
77,960 KB |
testcase_17 | AC | 835 ms
83,216 KB |
testcase_18 | AC | 448 ms
61,320 KB |
testcase_19 | AC | 937 ms
82,820 KB |
testcase_20 | AC | 664 ms
70,620 KB |
testcase_21 | AC | 528 ms
62,596 KB |
testcase_22 | AC | 769 ms
74,336 KB |
testcase_23 | AC | 189 ms
45,388 KB |
testcase_24 | AC | 792 ms
77,548 KB |
testcase_25 | AC | 628 ms
68,616 KB |
testcase_26 | AC | 799 ms
77,780 KB |
testcase_27 | AC | 567 ms
64,700 KB |
testcase_28 | AC | 561 ms
64,356 KB |
testcase_29 | AC | 496 ms
60,276 KB |
testcase_30 | AC | 261 ms
50,060 KB |
testcase_31 | AC | 415 ms
56,932 KB |
testcase_32 | AC | 404 ms
56,528 KB |
testcase_33 | AC | 860 ms
81,144 KB |
testcase_34 | AC | 805 ms
77,404 KB |
testcase_35 | AC | 421 ms
56,948 KB |
testcase_36 | AC | 522 ms
62,280 KB |
testcase_37 | AC | 623 ms
68,516 KB |
testcase_38 | AC | 854 ms
80,052 KB |
ソースコード
#!/usr/bin/env python3 # %% import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines # %% import numpy as np MOD = 10**9 + 7 # %% N = int(readline()) m = map(int, read().split()) UV = zip(m, m) # %% G = [[] for _ in range(N + 1)] for u, v in UV: G[u].append(v) G[v].append(u) # %% def cumprod(A, MOD=MOD): L = len(A) Lsq = int(L**.5 + 1) A = np.resize(A, Lsq**2).reshape(Lsq, Lsq) for n in range(1, Lsq): A[:, n] *= A[:, n - 1] A[:, n] %= MOD for n in range(1, Lsq): A[n] *= A[n - 1, -1] A[n] %= MOD return A.ravel()[:L] def make_fact(U, MOD=MOD): x = np.arange(U, dtype=np.int64) x[0] = 1 fact = cumprod(x, MOD) x = np.arange(U, 0, -1, dtype=np.int64) x[0] = pow(int(fact[-1]), MOD - 2, MOD) fact_inv = cumprod(x, MOD)[::-1] fact.flags.writeable = False fact_inv.flags.writeable = False return fact, fact_inv # %% fact, fact_inv = make_fact(2 * 10**5 + 10) inv = np.zeros_like(fact) inv[1:] = fact[:-1] * fact_inv[1:] % MOD inv = inv.tolist() # %% depth = [0] * (N + 1) depth[1] = 1 stack = [1] while stack: v = stack.pop() for w in G[v]: if depth[w]: continue depth[w] = depth[v] + 1 stack.append(w) # %% x = 0 for d in depth[1:]: x += inv[d] x %= MOD x *= fact[N] x %= MOD print(x)