Submission #61822542


Source Code Expand

Copy
def main():
Q = int(input())
queue = []
idx = 0
for _ in range(Q):
q = list(map(int, input().split()))
if q[0] == 1:
l = q[1]
if len(queue) == 0:
queue.append((l, 0))
else:
queue.append((l, sum(queue[-1])))
elif q[0] == 2:
idx += 1
else:
k = q[1]
print(queue[idx+k-1][1]-queue[idx][1])
if __name__ == '__main__':
main()
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
def main():
    Q = int(input())
    queue = []
    idx = 0

    for _ in range(Q):
        q = list(map(int, input().split()))
        if q[0] == 1:
            l = q[1]
            if len(queue) == 0:
                queue.append((l, 0))
            else:
                queue.append((l, sum(queue[-1])))
        elif q[0] == 2:
            idx += 1
        else:
            k = q[1]
            print(queue[idx+k-1][1]-queue[idx][1])

if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task C - Snake Queue
User keysersoze21
Language Python (PyPy 3.10-v7.3.12)
Score 300
Code Size 499 Byte
Status AC
Exec Time 448 ms
Memory 109796 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 33
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 02_min_00.txt, 02_min_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 59 ms 76536 KB
00_sample_01.txt AC 60 ms 76740 KB
00_sample_02.txt AC 60 ms 76656 KB
01_test_00.txt AC 65 ms 76816 KB
01_test_01.txt AC 82 ms 82232 KB
01_test_02.txt AC 108 ms 84540 KB
01_test_03.txt AC 111 ms 83624 KB
01_test_04.txt AC 64 ms 76376 KB
01_test_05.txt AC 111 ms 83548 KB
01_test_06.txt AC 446 ms 93412 KB
01_test_07.txt AC 270 ms 87436 KB
01_test_08.txt AC 448 ms 92980 KB
01_test_09.txt AC 406 ms 91636 KB
01_test_10.txt AC 448 ms 93224 KB
01_test_11.txt AC 239 ms 87576 KB
01_test_12.txt AC 446 ms 92796 KB
01_test_13.txt AC 234 ms 86300 KB
01_test_14.txt AC 443 ms 92648 KB
01_test_15.txt AC 337 ms 90196 KB
01_test_16.txt AC 324 ms 90056 KB
01_test_17.txt AC 321 ms 89936 KB
01_test_18.txt AC 285 ms 98144 KB
01_test_19.txt AC 273 ms 98156 KB
01_test_20.txt AC 277 ms 98328 KB
01_test_21.txt AC 276 ms 98272 KB
01_test_22.txt AC 381 ms 94120 KB
01_test_23.txt AC 422 ms 94196 KB
01_test_24.txt AC 208 ms 109692 KB
01_test_25.txt AC 206 ms 109416 KB
01_test_26.txt AC 211 ms 109796 KB
01_test_27.txt AC 208 ms 96452 KB
02_min_00.txt AC 60 ms 76508 KB
02_min_01.txt AC 60 ms 76680 KB


2025-04-28 (Mon)
01:39:41 +00:00