結果
問題 | No.2601 Very Poor |
ユーザー | cleantted |
提出日時 | 2023-11-24 03:53:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 244 ms / 2,000 ms |
コード長 | 1,419 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 81,956 KB |
実行使用メモリ | 120,620 KB |
最終ジャッジ日時 | 2024-03-20 19:43:04 |
合計ジャッジ時間 | 9,461 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 169 ms
89,596 KB |
testcase_01 | AC | 169 ms
89,596 KB |
testcase_02 | AC | 170 ms
89,596 KB |
testcase_03 | AC | 169 ms
89,596 KB |
testcase_04 | AC | 170 ms
89,596 KB |
testcase_05 | AC | 177 ms
89,724 KB |
testcase_06 | AC | 178 ms
89,724 KB |
testcase_07 | AC | 172 ms
89,724 KB |
testcase_08 | AC | 173 ms
89,724 KB |
testcase_09 | AC | 178 ms
89,724 KB |
testcase_10 | AC | 175 ms
89,724 KB |
testcase_11 | AC | 174 ms
89,724 KB |
testcase_12 | AC | 171 ms
89,724 KB |
testcase_13 | AC | 174 ms
89,724 KB |
testcase_14 | AC | 175 ms
89,724 KB |
testcase_15 | AC | 233 ms
120,616 KB |
testcase_16 | AC | 227 ms
120,612 KB |
testcase_17 | AC | 229 ms
120,616 KB |
testcase_18 | AC | 232 ms
120,616 KB |
testcase_19 | AC | 231 ms
120,612 KB |
testcase_20 | AC | 229 ms
120,620 KB |
testcase_21 | AC | 230 ms
120,612 KB |
testcase_22 | AC | 228 ms
120,612 KB |
testcase_23 | AC | 244 ms
120,616 KB |
testcase_24 | AC | 230 ms
120,620 KB |
testcase_25 | AC | 230 ms
120,616 KB |
testcase_26 | AC | 232 ms
120,616 KB |
testcase_27 | AC | 231 ms
120,616 KB |
testcase_28 | AC | 228 ms
120,616 KB |
testcase_29 | AC | 228 ms
120,620 KB |
testcase_30 | AC | 228 ms
120,612 KB |
testcase_31 | AC | 229 ms
120,616 KB |
testcase_32 | AC | 227 ms
120,616 KB |
testcase_33 | AC | 229 ms
120,608 KB |
testcase_34 | AC | 230 ms
120,616 KB |
testcase_35 | AC | 173 ms
89,724 KB |
testcase_36 | AC | 175 ms
89,724 KB |
ソースコード
import copy import heapq import itertools import math import operator import sys from bisect import bisect, bisect_left, bisect_right, insort from collections import Counter, deque from fractions import Fraction from functools import cmp_to_key, lru_cache, partial from inspect import currentframe from math import ceil, gcd, log10, pi, sqrt # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') input = sys.stdin.readline sys.setrecursionlimit(10000000) # mod = 10 ** 9 + 7 mod = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return tuple(map(int, input().split())) def read_index(): return tuple(map(lambda x: int(x) - 1, input().split())) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def dprint(*values): print(*values, file=sys.stderr) def dprint2(*values): names = {id(v): k for k, v in currentframe().f_back.f_locals.items()} dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values)) def main(): N, X = read_values() A = read_list() A += A r = 0 t = 0 res = 0 for i in range(N): while t <= X and r <= i + N: res = max(t, res) t += A[r] r += 1 t -= A[i] print(res) if __name__ == "__main__": main()