結果
問題 | No.1937 Various Tournament |
ユーザー | first_vil |
提出日時 | 2023-03-24 23:07:13 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,240 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 81,816 KB |
実行使用メモリ | 137,668 KB |
最終ジャッジ日時 | 2023-10-18 21:29:48 |
合計ジャッジ時間 | 44,730 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
55,616 KB |
testcase_01 | TLE | - |
testcase_02 | AC | 1,678 ms
137,528 KB |
testcase_03 | AC | 1,675 ms
137,528 KB |
testcase_04 | AC | 1,674 ms
137,528 KB |
testcase_05 | AC | 61 ms
66,424 KB |
testcase_06 | AC | 1,676 ms
137,528 KB |
testcase_07 | AC | 1,675 ms
137,524 KB |
testcase_08 | AC | 59 ms
66,388 KB |
testcase_09 | AC | 1,672 ms
137,532 KB |
testcase_10 | AC | 60 ms
66,424 KB |
testcase_11 | AC | 1,677 ms
137,528 KB |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | AC | 1,676 ms
137,528 KB |
testcase_15 | AC | 1,678 ms
137,532 KB |
testcase_16 | AC | 1,668 ms
137,528 KB |
testcase_17 | AC | 1,692 ms
137,528 KB |
testcase_18 | AC | 1,681 ms
137,528 KB |
testcase_19 | AC | 1,678 ms
137,528 KB |
testcase_20 | AC | 60 ms
66,388 KB |
testcase_21 | AC | 47 ms
55,552 KB |
testcase_22 | AC | 1,685 ms
137,528 KB |
testcase_23 | AC | 1,680 ms
137,524 KB |
testcase_24 | AC | 1,679 ms
137,528 KB |
testcase_25 | AC | 61 ms
66,424 KB |
testcase_26 | AC | 1,675 ms
137,528 KB |
testcase_27 | AC | 45 ms
55,552 KB |
testcase_28 | AC | 1,680 ms
137,528 KB |
testcase_29 | AC | 60 ms
66,388 KB |
testcase_30 | AC | 1,716 ms
137,528 KB |
testcase_31 | AC | 1,690 ms
137,600 KB |
testcase_32 | AC | 1,690 ms
137,604 KB |
testcase_33 | AC | 1,677 ms
137,600 KB |
testcase_34 | AC | 1,698 ms
137,608 KB |
testcase_35 | AC | 1,685 ms
137,604 KB |
testcase_36 | AC | 1,701 ms
137,600 KB |
testcase_37 | AC | 59 ms
66,460 KB |
testcase_38 | AC | 59 ms
66,496 KB |
testcase_39 | AC | 1,670 ms
137,596 KB |
testcase_40 | AC | 59 ms
66,460 KB |
testcase_41 | AC | 61 ms
66,496 KB |
testcase_42 | AC | 1,674 ms
137,600 KB |
testcase_43 | AC | 61 ms
66,496 KB |
testcase_44 | AC | 46 ms
55,616 KB |
testcase_45 | AC | 1,671 ms
137,596 KB |
testcase_46 | AC | 60 ms
66,496 KB |
testcase_47 | AC | 45 ms
55,616 KB |
testcase_48 | AC | 45 ms
55,616 KB |
testcase_49 | AC | 61 ms
66,496 KB |
ソースコード
from functools import lru_cache import sys int1 = lambda x: int(x) - 1 # input = lambda: sys.stdin.buffer.readline() input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) i1 = lambda: int1(input()) mi = lambda: map(int, input().split()) mi1 = lambda: map(int1, input().split()) li = lambda: list(mi()) li1 = lambda: list(mi1()) lli = lambda n: [li() for _ in range(n)] INF = float("inf") # mod = int(1e9 + 7) mod = 998244353 N = ii() win = [[j for j, x in enumerate(li()) if x == 1] for i in range(N)] pcnt = [0] * (1 << N) for bit in range(1 << N): x = bit while x: pcnt[bit] += x & 1 x >>= 1 half = [list() for i in range(1 << N)] for bit in range(1 << N): sub = bit while sub >= 0: sub &= bit if pcnt[sub] * 2 == pcnt[bit]: half[bit].append(sub) sub -= 1 dp = [[0] * N for i in range(1 << N)] for bit in range(1 << N): if pcnt[pcnt[bit]] != 1: continue if pcnt[bit] == 1: dp[bit] = [bit >> i & 1 for i in range(N)] for sub in half[bit]: bus = bit ^ sub for i in range(N): for j in win[i]: dp[bit][i] += dp[sub][i] * dp[bus][j] * 2 for x in dp[(1 << N) - 1]: print(x)