結果
問題 | No.1512 作文 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 12:48:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,127 bytes |
コンパイル時間 | 267 ms |
コンパイル使用メモリ | 86,920 KB |
実行使用メモリ | 116,204 KB |
最終ジャッジ日時 | 2023-08-23 15:03:39 |
合計ジャッジ時間 | 12,823 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 228 ms
92,232 KB |
testcase_01 | AC | 229 ms
92,268 KB |
testcase_02 | AC | 221 ms
92,448 KB |
testcase_03 | AC | 229 ms
92,064 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 226 ms
92,092 KB |
testcase_10 | AC | 228 ms
92,180 KB |
testcase_11 | AC | 229 ms
92,128 KB |
testcase_12 | AC | 230 ms
92,112 KB |
testcase_13 | AC | 229 ms
92,092 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 | 227 ms
92,248 KB |
testcase_22 | AC | 225 ms
92,284 KB |
testcase_23 | AC | 230 ms
92,308 KB |
testcase_24 | AC | 228 ms
92,300 KB |
testcase_25 | AC | 228 ms
92,252 KB |
testcase_26 | AC | 229 ms
92,156 KB |
testcase_27 | AC | 230 ms
92,096 KB |
testcase_28 | AC | 227 ms
92,200 KB |
testcase_29 | AC | 228 ms
92,076 KB |
testcase_30 | AC | 232 ms
92,248 KB |
testcase_31 | AC | 228 ms
92,556 KB |
testcase_32 | AC | 226 ms
92,656 KB |
testcase_33 | AC | 226 ms
92,564 KB |
testcase_34 | AC | 229 ms
92,380 KB |
testcase_35 | AC | 231 ms
92,612 KB |
testcase_36 | AC | 233 ms
92,904 KB |
testcase_37 | AC | 233 ms
92,388 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 376 ms
112,068 KB |
testcase_41 | AC | 364 ms
116,204 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(i, 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()