結果
問題 | No.1494 LCS on Tree |
ユーザー | mkawa2 |
提出日時 | 2022-11-09 14:28:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,537 bytes |
コンパイル時間 | 253 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 144,068 KB |
最終ジャッジ日時 | 2023-09-30 02:33:50 |
合計ジャッジ時間 | 24,853 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,532 KB |
testcase_01 | AC | 70 ms
71,384 KB |
testcase_02 | AC | 71 ms
71,388 KB |
testcase_03 | WA | - |
testcase_04 | AC | 834 ms
143,740 KB |
testcase_05 | AC | 747 ms
143,620 KB |
testcase_06 | WA | - |
testcase_07 | AC | 749 ms
143,656 KB |
testcase_08 | AC | 714 ms
143,896 KB |
testcase_09 | AC | 713 ms
143,776 KB |
testcase_10 | AC | 844 ms
143,452 KB |
testcase_11 | AC | 728 ms
143,172 KB |
testcase_12 | AC | 706 ms
143,480 KB |
testcase_13 | AC | 829 ms
143,692 KB |
testcase_14 | AC | 570 ms
142,568 KB |
testcase_15 | AC | 586 ms
142,696 KB |
testcase_16 | AC | 620 ms
143,276 KB |
testcase_17 | AC | 622 ms
143,112 KB |
testcase_18 | AC | 605 ms
142,352 KB |
testcase_19 | AC | 71 ms
71,292 KB |
testcase_20 | AC | 72 ms
71,132 KB |
testcase_21 | AC | 72 ms
71,436 KB |
testcase_22 | AC | 71 ms
71,444 KB |
testcase_23 | AC | 71 ms
71,392 KB |
testcase_24 | AC | 71 ms
71,468 KB |
testcase_25 | AC | 71 ms
71,296 KB |
testcase_26 | AC | 72 ms
71,272 KB |
testcase_27 | AC | 71 ms
71,460 KB |
testcase_28 | AC | 72 ms
71,440 KB |
testcase_29 | AC | 72 ms
71,448 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 609 ms
143,260 KB |
testcase_33 | WA | - |
testcase_34 | AC | 608 ms
142,456 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 181 ms
81,928 KB |
testcase_38 | AC | 294 ms
93,636 KB |
testcase_39 | AC | 433 ms
108,408 KB |
testcase_40 | AC | 249 ms
88,536 KB |
testcase_41 | AC | 571 ms
126,936 KB |
testcase_42 | AC | 241 ms
88,104 KB |
testcase_43 | AC | 533 ms
121,948 KB |
testcase_44 | AC | 450 ms
110,528 KB |
testcase_45 | AC | 770 ms
142,380 KB |
testcase_46 | AC | 769 ms
142,480 KB |
testcase_47 | AC | 808 ms
142,092 KB |
testcase_48 | AC | 830 ms
142,196 KB |
testcase_49 | AC | 781 ms
142,360 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 n = II() s = [ord(c)-97 for c in SI()] m = len(s) to = [[] for _ in range(n)] for _ in range(n-1): u, v, c = SI().split() u = int1(u) v = int1(v) c = ord(c)-97 to[u].append((v, c)) to[v].append((u, c)) parent, depth, vis = [-1]*n, [0]*n, [0]*n cc = [""]*n def dfs(root): uu = [] vis[root] = 1 stack = [root] while stack: iu = stack.pop() i, u = divmod(iu, n) if i == 0: uu.append(u) # care to's format while i < len(to[u]) and vis[to[u][i][0]]: i += 1 if i < len(to[u]): stack.append((i+1)*n+u) # care to's format v, c = to[u][i] vis[v] = 1 stack.append(v) parent[v] = u depth[v] = depth[u]+1 cc[v] = c return uu uu = dfs(0) def dodp(s): def chmax(i, j, val): if val > dp[i][j]: dp[i][j] = val dp = [[0]*(m+1) for _ in range(n)] for u in uu[::-1]: if u == 0: break if len(to[u]) == 1: val = 0 for i, c in enumerate(s): if c == cc[u]: val = 1 dp[u][i+1] = val p = parent[u] for i in range(m+1): pre = dp[u][i] if i<m and cc[p] == s[i]: chmax(p, i+1, pre+1) elif pre: chmax(p, i, pre) if i+1 <= m: chmax(u, i+1, pre) return dp dp = dodp(s) rdp = dodp(s[::-1]) # pDB(rdp) ans = 0 for u in range(n): for i in range(m+1): m1 = m2 = 0 for v, _ in to[u]: if v == parent[u]: continue v1, v2 = dp[v][i], rdp[v][m-i] if v1+m2 > ans: ans = v1+m2 if v2+m1 > ans: ans = v2+m1 if v1 > m1: m1 = v1 if v2 > m2: m2 = m2 print(ans)