結果
問題 | No.1512 作文 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 12:55:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 350 ms / 2,000 ms |
コード長 | 2,226 bytes |
コンパイル時間 | 262 ms |
コンパイル使用メモリ | 86,788 KB |
実行使用メモリ | 97,324 KB |
最終ジャッジ日時 | 2023-08-23 15:03:56 |
合計ジャッジ時間 | 12,857 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,212 KB |
testcase_01 | AC | 233 ms
92,024 KB |
testcase_02 | AC | 228 ms
92,192 KB |
testcase_03 | AC | 230 ms
92,080 KB |
testcase_04 | AC | 348 ms
96,896 KB |
testcase_05 | AC | 346 ms
97,324 KB |
testcase_06 | AC | 344 ms
96,948 KB |
testcase_07 | AC | 345 ms
96,672 KB |
testcase_08 | AC | 350 ms
97,020 KB |
testcase_09 | AC | 226 ms
92,104 KB |
testcase_10 | AC | 227 ms
92,120 KB |
testcase_11 | AC | 229 ms
92,392 KB |
testcase_12 | AC | 232 ms
92,256 KB |
testcase_13 | AC | 226 ms
92,044 KB |
testcase_14 | AC | 280 ms
93,880 KB |
testcase_15 | AC | 303 ms
94,440 KB |
testcase_16 | AC | 282 ms
94,124 KB |
testcase_17 | AC | 276 ms
94,100 KB |
testcase_18 | AC | 273 ms
94,144 KB |
testcase_19 | AC | 277 ms
93,904 KB |
testcase_20 | AC | 278 ms
93,896 KB |
testcase_21 | AC | 228 ms
92,204 KB |
testcase_22 | AC | 237 ms
92,028 KB |
testcase_23 | AC | 232 ms
92,084 KB |
testcase_24 | AC | 232 ms
92,100 KB |
testcase_25 | AC | 230 ms
92,456 KB |
testcase_26 | AC | 233 ms
92,120 KB |
testcase_27 | AC | 229 ms
92,316 KB |
testcase_28 | AC | 228 ms
92,072 KB |
testcase_29 | AC | 230 ms
92,348 KB |
testcase_30 | AC | 228 ms
92,232 KB |
testcase_31 | AC | 233 ms
92,380 KB |
testcase_32 | AC | 234 ms
92,396 KB |
testcase_33 | AC | 230 ms
92,528 KB |
testcase_34 | AC | 231 ms
92,500 KB |
testcase_35 | AC | 234 ms
92,684 KB |
testcase_36 | AC | 237 ms
92,884 KB |
testcase_37 | AC | 231 ms
92,540 KB |
testcase_38 | AC | 234 ms
92,584 KB |
testcase_39 | AC | 236 ms
92,744 KB |
testcase_40 | AC | 309 ms
93,956 KB |
testcase_41 | AC | 309 ms
93,580 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) table = [[] for i in range(26)] bonasu = [0] * 26 for i in range(N): S = input() lenS = len(S) juge = True for j in range(lenS-1): a, b = S[j], S[j+1] if a > b: juge = False break if juge: top = S[0] under = S[-1] if top == under: p = ord(top) - 97 bonasu[p] += lenS else: p = ord(top) - 97 pp = ord(under) - 97 table[p].append([pp, lenS]) for i in range(26): for j in range(i, 26): table[i].append([j, 0]) table[i].append([i, bonasu[i]]) for i in range(26): table[i].sort() dp = [0] * 26 for i in range(26): for nxt, cost in table[i]: dp[nxt] = max(dp[nxt], dp[i] + cost) print(max(dp)) if __name__ == '__main__': main()