結果
問題 | No.1512 作文 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 12:43:57 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,124 bytes |
コンパイル時間 | 281 ms |
コンパイル使用メモリ | 86,724 KB |
実行使用メモリ | 116,304 KB |
最終ジャッジ日時 | 2023-08-23 15:03:25 |
合計ジャッジ時間 | 14,776 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
92,116 KB |
testcase_01 | AC | 229 ms
92,116 KB |
testcase_02 | AC | 227 ms
92,364 KB |
testcase_03 | AC | 232 ms
92,220 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 228 ms
92,312 KB |
testcase_10 | AC | 225 ms
92,316 KB |
testcase_11 | AC | 227 ms
92,304 KB |
testcase_12 | AC | 223 ms
92,268 KB |
testcase_13 | AC | 230 ms
92,116 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 234 ms
92,256 KB |
testcase_22 | AC | 232 ms
92,304 KB |
testcase_23 | AC | 232 ms
92,328 KB |
testcase_24 | AC | 229 ms
92,080 KB |
testcase_25 | AC | 225 ms
92,272 KB |
testcase_26 | AC | 227 ms
92,068 KB |
testcase_27 | AC | 228 ms
92,324 KB |
testcase_28 | AC | 228 ms
92,320 KB |
testcase_29 | AC | 229 ms
92,448 KB |
testcase_30 | AC | 231 ms
92,220 KB |
testcase_31 | AC | 231 ms
92,400 KB |
testcase_32 | AC | 229 ms
92,400 KB |
testcase_33 | AC | 227 ms
92,428 KB |
testcase_34 | AC | 230 ms
92,512 KB |
testcase_35 | AC | 233 ms
92,772 KB |
testcase_36 | AC | 232 ms
92,692 KB |
testcase_37 | AC | 235 ms
92,480 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 377 ms
112,244 KB |
testcase_41 | AC | 358 ms
116,304 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)] 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 table[p].append([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(26): table[i].append([j, 0]) 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()