結果
問題 | No.1512 作文 |
ユーザー | mkawa2 |
提出日時 | 2021-05-21 21:32:04 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 1,241 bytes |
コンパイル時間 | 99 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 13,184 KB |
最終ジャッジ日時 | 2024-04-18 14:38:09 |
合計ジャッジ時間 | 4,299 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
10,752 KB |
testcase_01 | AC | 29 ms
10,752 KB |
testcase_02 | AC | 31 ms
10,752 KB |
testcase_03 | AC | 29 ms
10,880 KB |
testcase_04 | AC | 188 ms
13,184 KB |
testcase_05 | AC | 190 ms
13,056 KB |
testcase_06 | AC | 187 ms
13,056 KB |
testcase_07 | AC | 190 ms
13,184 KB |
testcase_08 | AC | 186 ms
13,184 KB |
testcase_09 | AC | 30 ms
10,752 KB |
testcase_10 | AC | 30 ms
10,880 KB |
testcase_11 | AC | 30 ms
10,880 KB |
testcase_12 | AC | 29 ms
11,008 KB |
testcase_13 | AC | 30 ms
11,008 KB |
testcase_14 | AC | 45 ms
10,880 KB |
testcase_15 | AC | 46 ms
10,752 KB |
testcase_16 | AC | 46 ms
10,880 KB |
testcase_17 | AC | 48 ms
10,880 KB |
testcase_18 | AC | 46 ms
10,880 KB |
testcase_19 | AC | 47 ms
10,880 KB |
testcase_20 | AC | 47 ms
10,880 KB |
testcase_21 | AC | 31 ms
11,008 KB |
testcase_22 | AC | 29 ms
10,880 KB |
testcase_23 | AC | 30 ms
10,880 KB |
testcase_24 | AC | 30 ms
10,880 KB |
testcase_25 | AC | 29 ms
10,880 KB |
testcase_26 | AC | 29 ms
10,752 KB |
testcase_27 | AC | 29 ms
10,752 KB |
testcase_28 | AC | 29 ms
10,752 KB |
testcase_29 | AC | 29 ms
10,752 KB |
testcase_30 | AC | 29 ms
10,880 KB |
testcase_31 | AC | 29 ms
11,008 KB |
testcase_32 | AC | 30 ms
10,752 KB |
testcase_33 | AC | 31 ms
10,880 KB |
testcase_34 | AC | 31 ms
10,752 KB |
testcase_35 | AC | 55 ms
11,392 KB |
testcase_36 | AC | 55 ms
11,392 KB |
testcase_37 | AC | 44 ms
11,136 KB |
testcase_38 | AC | 53 ms
10,880 KB |
testcase_39 | AC | 53 ms
11,008 KB |
testcase_40 | AC | 235 ms
11,008 KB |
testcase_41 | AC | 227 ms
10,880 KB |
ソースコード
import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # 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)] dij = [(0, 1), (1, 0), (1, 1), (1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 def isbad(s): for i in range(len(s)-1): if s[i] > s[i+1]: return True return False n = II() to = [[] for _ in range(27)] loop = [0]*26 for _ in range(n): s = BI() if isbad(s): continue u = s[0]-97 v = s[-1]-97 c = len(s) if u == v: loop[u] += c else: to[u].append((v, c)) dp = [0]*27 for u in range(26): dp[u] += loop[u] dp[u+1] = max(dp[u+1], dp[u]) for v, c in to[u]: dp[v] = max(dp[v], dp[u]+c) print(dp[-1])