Submission #37501956

Source Code Expand

N = int(input())
A = list(map(int, input().split()))
Q = int(input())

for i in range(Q):
    kx = list(map(int, input().split()))
    if kx[0] == 2:
        print(A[kx[1]-1])
    else:
        A[kx[1]-1] = kx[2]

Submission Info

Submission Time
Task B - First Query Problem
User bobslay
Language Python (3.8.2)
Score 200
Code Size 221 Byte
Status AC
Exec Time 478 ms
Memory 20004 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 11
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_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 25 ms 8912 KiB
00_sample_01.txt AC 18 ms 8912 KiB
00_sample_02.txt AC 18 ms 9044 KiB
01_random_03.txt AC 327 ms 9032 KiB
01_random_04.txt AC 363 ms 20004 KiB
01_random_05.txt AC 363 ms 19708 KiB
01_random_06.txt AC 77 ms 17280 KiB
01_random_07.txt AC 252 ms 19908 KiB
01_random_08.txt AC 478 ms 19904 KiB
01_random_09.txt AC 355 ms 19716 KiB
01_random_10.txt AC 350 ms 19808 KiB