結果
問題 | No.291 黒い文字列 |
ユーザー | mkawa2 |
提出日時 | 2023-03-16 15:13:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,421 ms / 2,000 ms |
コード長 | 1,751 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 82,292 KB |
実行使用メモリ | 213,376 KB |
最終ジャッジ日時 | 2024-09-18 09:21:34 |
合計ジャッジ時間 | 7,199 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
52,352 KB |
testcase_01 | AC | 34 ms
52,736 KB |
testcase_02 | AC | 36 ms
52,352 KB |
testcase_03 | AC | 36 ms
52,736 KB |
testcase_04 | AC | 33 ms
52,352 KB |
testcase_05 | AC | 32 ms
52,608 KB |
testcase_06 | AC | 33 ms
52,480 KB |
testcase_07 | AC | 33 ms
52,096 KB |
testcase_08 | AC | 33 ms
52,864 KB |
testcase_09 | AC | 37 ms
52,736 KB |
testcase_10 | AC | 45 ms
60,236 KB |
testcase_11 | AC | 77 ms
76,680 KB |
testcase_12 | AC | 77 ms
76,364 KB |
testcase_13 | AC | 36 ms
52,732 KB |
testcase_14 | AC | 37 ms
58,624 KB |
testcase_15 | AC | 36 ms
52,864 KB |
testcase_16 | AC | 184 ms
82,128 KB |
testcase_17 | AC | 227 ms
87,496 KB |
testcase_18 | AC | 182 ms
83,428 KB |
testcase_19 | AC | 459 ms
113,424 KB |
testcase_20 | AC | 604 ms
115,240 KB |
testcase_21 | AC | 204 ms
212,992 KB |
testcase_22 | AC | 786 ms
168,188 KB |
testcase_23 | AC | 1,421 ms
193,592 KB |
testcase_24 | AC | 371 ms
148,468 KB |
testcase_25 | AC | 200 ms
213,376 KB |
testcase_26 | AC | 196 ms
213,120 KB |
testcase_27 | AC | 196 ms
212,992 KB |
testcase_28 | AC | 199 ms
212,992 KB |
testcase_29 | AC | 200 ms
212,864 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) 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 = (1 << 63)-1 # inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 def pack(ii): p = 0 for i in ii: p = p*m1+i return p def unpack(p): ii = [0]*4 for j in range(4): p, i = divmod(p, m1) ii[j] = i return ii[::-1] s = [] for c in SI(): c = "KUROI?".find(c) if c == -1: continue s.append(c) m = len(s)//5 m1 = m+1 n = m1**4 dp = [-1]*n dp[0] = 0 def upd(c): np, d = p, 0 if c == 0: if ii[0] != m: ii[0] += 1 np = pack(ii) ii[0] -= 1 elif c == 4: if ii[3]: ii[3] -= 1 np = pack(ii) ii[3] += 1 d = 1 else: if ii[c] < m and ii[c-1]: ii[c] += 1 ii[c-1] -= 1 np = pack(ii) ii[c] -= 1 ii[c-1] += 1 ndp[np] = max(ndp[np], dp[p]+d) for c in s: ndp = [-1]*n for p in range(n): if dp[p] == -1: continue ii = unpack(p) if c == 5: for a in range(5): upd(a) else: upd(c) dp = ndp print(max(dp))