結果
問題 | No.1561 connect x connect |
ユーザー | uwi |
提出日時 | 2020-11-27 02:31:59 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,092 bytes |
コンパイル時間 | 927 ms |
コンパイル使用メモリ | 87,152 KB |
実行使用メモリ | 208,872 KB |
最終ジャッジ日時 | 2023-09-07 13:51:10 |
合計ジャッジ時間 | 15,005 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
87,940 KB |
testcase_01 | AC | 390 ms
92,576 KB |
testcase_02 | AC | 1,453 ms
163,440 KB |
testcase_03 | AC | 258 ms
88,276 KB |
testcase_04 | AC | 264 ms
88,404 KB |
testcase_05 | AC | 296 ms
90,536 KB |
testcase_06 | AC | 271 ms
88,352 KB |
testcase_07 | AC | 333 ms
91,452 KB |
testcase_08 | AC | 390 ms
93,232 KB |
testcase_09 | AC | 404 ms
93,196 KB |
testcase_10 | AC | 405 ms
92,800 KB |
testcase_11 | AC | 491 ms
93,356 KB |
testcase_12 | AC | 664 ms
99,544 KB |
testcase_13 | AC | 1,227 ms
147,776 KB |
testcase_14 | AC | 1,303 ms
208,872 KB |
testcase_15 | TLE | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
ソースコード
import dataclasses import sys sys.setrecursionlimit(500005) stdin = sys.stdin ni = lambda: int(ns()) na = lambda: list(map(int, stdin.readline().split())) ns = lambda: stdin.readline().strip() @dataclasses.dataclass class State: clus: [int] val: int hidden: int def h(self): return (*self.clus, self.hidden) mod = 1000000007 def normalize(a: [int]) -> [int]: label = [-1] * 11 p = 0 for i in range(len(a)): if a[i] == -1: continue if label[a[i]] == -1: label[a[i]] = p p += 1 a[i] = label[a[i]] return a def add(s: State, dp: [int, State]): key = s.h() if key in dp: dp[key].val = (dp[key].val + s.val) % mod else: dp[key] = s n, m = na() initial = State([-1] * n, 1, 0) dp: [int, State] = dict() dp[initial.h()] = initial for j in range(m+1): for i in range(n): ndp = dict() for s in dp.values(): # 黒いセルを追加 nclus = [0] * n for k in range(n-1): nclus[k+1] = s.clus[k] nclus[0] = n if i > 0 and s.clus[0] != -1: for k in range(1, n): if nclus[k] == s.clus[0]: nclus[k] = n if s.clus[-1] != -1: for k in range(1, n): if nclus[k] == s.clus[-1]: nclus[k] = n normalize(nclus) ns = State(nclus, s.val, s.hidden) add(ns, ndp) nclus = [0] * n for k in range(n-1): nclus[k+1] = s.clus[k] nclus[0] = -1 nhidden = s.hidden if s.clus[-1] != -1 and all(s.clus[_] != s.clus[-1] for _ in range(n-1)): nhidden += 1 if nhidden <= 1: normalize(nclus) ns = State(nclus, s.val, nhidden) add(ns, ndp) dp = ndp ans = 0 for s in dp.values(): if s.hidden == 1 and all(_ == -1 for _ in s.clus): ans += s.val print(ans % mod)