Submission #75921282


Source Code Expand

import sys
input = sys.stdin.readline

def calc(a,l):
    global ans
    for _ in range(a):
        m,c = 0,0
        k,*L = map(int,input().split())
        for i in range(min(l,k)):
            c += L[i]
            m = max(m,c)
        ans += m

n,t = map(int,input().split())
ans = 0
calc(t%n,t//n+1)
calc(n-t%n,t//n)
print(ans)

Submission Info

Submission Time
Task D - Sushisushi Conveyor Belt Sushi Restaurant
User Cenix820
Language Python (PyPy 3.11-v7.3.20)
Score 100
Code Size 349 Byte
Status AC
Exec Time 222 ms
Memory 281772 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status AC
AC × 22
Set Name Test Cases
Sample
All 01, 02, 03, 04, 05, 06, 07, 08, 09, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22
Case Name Status Exec Time Memory
01 AC 56 ms 79468 KiB
02 AC 60 ms 87652 KiB
03 AC 63 ms 92684 KiB
04 AC 67 ms 97992 KiB
05 AC 201 ms 276808 KiB
06 AC 205 ms 281772 KiB
07 AC 208 ms 108392 KiB
08 AC 209 ms 108508 KiB
09 AC 88 ms 108372 KiB
10 AC 100 ms 108600 KiB
11 AC 130 ms 108660 KiB
12 AC 131 ms 108364 KiB
13 AC 131 ms 108720 KiB
14 AC 136 ms 108720 KiB
15 AC 171 ms 108724 KiB
16 AC 222 ms 108748 KiB
17 AC 94 ms 107712 KiB
18 AC 203 ms 279396 KiB
19 AC 82 ms 108080 KiB
20 AC 81 ms 108380 KiB
21 AC 85 ms 108208 KiB
22 AC 63 ms 89148 KiB