結果
問題 | No.562 超高速一人かるた small |
ユーザー | mkawa2 |
提出日時 | 2021-11-12 18:39:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,051 ms / 3,000 ms |
コード長 | 2,400 bytes |
コンパイル時間 | 121 ms |
コンパイル使用メモリ | 82,780 KB |
実行使用メモリ | 100,368 KB |
最終ジャッジ日時 | 2024-05-04 01:31:39 |
合計ジャッジ時間 | 23,697 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
75,744 KB |
testcase_01 | AC | 50 ms
76,136 KB |
testcase_02 | AC | 48 ms
76,708 KB |
testcase_03 | AC | 48 ms
76,164 KB |
testcase_04 | AC | 63 ms
83,448 KB |
testcase_05 | AC | 65 ms
85,240 KB |
testcase_06 | AC | 49 ms
76,572 KB |
testcase_07 | AC | 85 ms
91,956 KB |
testcase_08 | AC | 301 ms
92,372 KB |
testcase_09 | AC | 1,805 ms
99,884 KB |
testcase_10 | AC | 511 ms
93,684 KB |
testcase_11 | AC | 940 ms
95,496 KB |
testcase_12 | AC | 261 ms
92,380 KB |
testcase_13 | AC | 65 ms
85,376 KB |
testcase_14 | AC | 1,746 ms
99,788 KB |
testcase_15 | AC | 1,890 ms
100,080 KB |
testcase_16 | AC | 2,051 ms
99,668 KB |
testcase_17 | AC | 1,772 ms
99,556 KB |
testcase_18 | AC | 1,774 ms
99,548 KB |
testcase_19 | AC | 1,779 ms
99,536 KB |
testcase_20 | AC | 1,806 ms
99,472 KB |
testcase_21 | AC | 1,753 ms
99,628 KB |
testcase_22 | AC | 1,925 ms
100,084 KB |
testcase_23 | AC | 1,884 ms
100,368 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = 18446744073709551615 inf = 4294967295 md = 10**9+7 # md = 998244353 def add(s, i): u = 0 for c in s: if c not in trie[u]: trie[u][c] = len(trie) trie.append({}) vv.append(0) u = trie[u][c] vv[u] |= 1 << i trie[u]["end"] = s def search(s): bb, dd = [], [] u = 0 d = 0 now = -1 for c in s: u = trie[u][c] d += 1 if vv[u] != now: now = vv[u] bb.append(now) dd.append(d) return bb, dd def nHr(hn, hr): return nCr(hn+hr-1, hr-1) def nPr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_n-com_r]%md def nCr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md # 準備 n_max = 200005 fac = [1] for i in range(1, n_max+1): fac.append(fac[-1]*i%md) ifac = [1]*(n_max+1) ifac[n_max] = pow(fac[n_max], md-2, md) for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md trie = [{}] vv = [0] n = II() ss = [SI()+"@" for _ in range(n)] for i, s in enumerate(ss): add(s, i) bbs, dds = [], [] for i, s in enumerate(ss): bb, dd = search(s) bbs.append(bb) dds.append(dd) popcnt = lambda x: bin(x).count("1") dp = [0]*(1 << n) ans = [0]*(n+1) for bit in range((1 << n)-1)[::-1]: k = n-popcnt(bit) for i, s in enumerate(ss): if bit >> i & 1: continue nbit = bit | 1 << i cost = 0 for b, d in zip(bbs[i], dds[i]): if bit & b == 0: cost = d break dp[bit] += dp[nbit]+cost dp[bit] = dp[bit]*pow(k, md-2, md)%md ans[k] += dp[bit] for k in range(1, n+1): ans[k] *= fac[k] ans[k] %= md print(*ans[1:], sep="\n")