結果
問題 | No.1535 五七五 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 22:25:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 339 ms / 2,000 ms |
コード長 | 1,890 bytes |
コンパイル時間 | 248 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 237,836 KB |
最終ジャッジ日時 | 2024-06-01 12:42:56 |
合計ジャッジ時間 | 7,132 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 148 ms
89,508 KB |
testcase_01 | AC | 146 ms
89,472 KB |
testcase_02 | AC | 146 ms
89,196 KB |
testcase_03 | AC | 143 ms
89,728 KB |
testcase_04 | AC | 275 ms
186,352 KB |
testcase_05 | AC | 337 ms
237,396 KB |
testcase_06 | AC | 339 ms
237,836 KB |
testcase_07 | AC | 143 ms
89,700 KB |
testcase_08 | AC | 145 ms
89,472 KB |
testcase_09 | AC | 143 ms
89,228 KB |
testcase_10 | AC | 142 ms
89,588 KB |
testcase_11 | AC | 147 ms
89,648 KB |
testcase_12 | AC | 147 ms
89,344 KB |
testcase_13 | AC | 142 ms
89,652 KB |
testcase_14 | AC | 145 ms
89,344 KB |
testcase_15 | AC | 141 ms
89,628 KB |
testcase_16 | AC | 141 ms
89,684 KB |
testcase_17 | AC | 142 ms
89,484 KB |
testcase_18 | AC | 316 ms
221,224 KB |
testcase_19 | AC | 310 ms
221,040 KB |
testcase_20 | AC | 326 ms
221,336 KB |
testcase_21 | AC | 332 ms
221,096 KB |
testcase_22 | AC | 323 ms
221,308 KB |
testcase_23 | AC | 317 ms
221,220 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()) A, B, C = i_map() base = s_list() total = A + B + C S = [0] for i in range(N): s = base[i] score = len(s) S.append(score) AS = list(accumulate(S)) #print(AS) juge = [False] * (AS[-1]+1) for i in range(N+1): juge[AS[i]] = True ans = 0 for i in range(N+1): if AS[i] + total <= AS[-1]: a = AS[i] + A b = a + B c = b + C if juge[a] and juge[b] and juge[c]: ans += 1 else: break print(ans) if __name__ == '__main__': main()