結果
問題 | No.1512 作文 |
ユーザー | McGregorsh |
提出日時 | 2022-07-20 14:46:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,210 bytes |
コンパイル時間 | 335 ms |
コンパイル使用メモリ | 87,148 KB |
実行使用メモリ | 135,984 KB |
最終ジャッジ日時 | 2023-09-15 09:42:56 |
合計ジャッジ時間 | 16,668 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 237 ms
92,188 KB |
testcase_02 | AC | 239 ms
92,276 KB |
testcase_03 | WA | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | AC | 239 ms
92,192 KB |
testcase_10 | AC | 240 ms
92,100 KB |
testcase_11 | AC | 241 ms
92,216 KB |
testcase_12 | AC | 242 ms
92,192 KB |
testcase_13 | AC | 252 ms
92,220 KB |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | AC | 252 ms
92,360 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 245 ms
92,348 KB |
testcase_26 | AC | 243 ms
91,988 KB |
testcase_27 | AC | 240 ms
92,328 KB |
testcase_28 | AC | 241 ms
92,100 KB |
testcase_29 | WA | - |
testcase_30 | AC | 246 ms
92,200 KB |
testcase_31 | AC | 242 ms
92,688 KB |
testcase_32 | RE | - |
testcase_33 | AC | 242 ms
92,460 KB |
testcase_34 | RE | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 242 ms
92,416 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
ソースコード
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 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()) nums = [[] for i in range(26)] bonasu = [0] * 26 for i in range(n): s = input() now = s[0] start = s[0] goal = s[-1] juge = True len_s = len(s) for j in range(len_s): if now > s[j]: juge = False break else: now = s[j] if juge: if start == goal: bonasu[ord(start)-97] += len_s else: nums[ord(start)-97].append([ord(goal)-97, len_s]) #print(nums) #print(bonasu) def dfs(s, p, score): for i in range(len(nums[s])): point, cost = nums[s][i] if point == p: continue dfs(point, s, score + bonasu[i] + cost) ans.append(score) ans = [] for i in range(26): dfs(i, -1, 0) print(max(ans)) if __name__ == '__main__': main()