結果
問題 | No.1535 五七五 |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 22:25:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 518 ms / 2,000 ms |
コード長 | 1,890 bytes |
コンパイル時間 | 359 ms |
コンパイル使用メモリ | 86,508 KB |
実行使用メモリ | 252,248 KB |
最終ジャッジ日時 | 2023-08-23 15:15:47 |
合計ジャッジ時間 | 10,201 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,288 KB |
testcase_01 | AC | 232 ms
92,096 KB |
testcase_02 | AC | 234 ms
91,944 KB |
testcase_03 | AC | 230 ms
92,096 KB |
testcase_04 | AC | 355 ms
200,348 KB |
testcase_05 | AC | 518 ms
250,860 KB |
testcase_06 | AC | 466 ms
252,248 KB |
testcase_07 | AC | 240 ms
92,068 KB |
testcase_08 | AC | 230 ms
91,852 KB |
testcase_09 | AC | 232 ms
92,300 KB |
testcase_10 | AC | 228 ms
92,096 KB |
testcase_11 | AC | 233 ms
92,108 KB |
testcase_12 | AC | 230 ms
91,864 KB |
testcase_13 | AC | 229 ms
92,128 KB |
testcase_14 | AC | 233 ms
92,208 KB |
testcase_15 | AC | 230 ms
92,036 KB |
testcase_16 | AC | 230 ms
91,836 KB |
testcase_17 | AC | 229 ms
92,112 KB |
testcase_18 | AC | 401 ms
209,308 KB |
testcase_19 | AC | 397 ms
209,472 KB |
testcase_20 | AC | 398 ms
209,508 KB |
testcase_21 | AC | 397 ms
209,552 KB |
testcase_22 | AC | 399 ms
209,636 KB |
testcase_23 | AC | 403 ms
209,436 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()