Submission #66729612

Source Code Expand

Copy
n, q = map(int, input().split())
a = [i+1 for i in range(n)]
first = 0
for _ in range(q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        p, x = query[1:]
        p -= 1
        a[(p + first) % n] = x
    elif query[0] == 2:
        p = query[-1] - 1
        print(a[(p + first) % n])
    else:
        first += query[-1]
        first %= n
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
n, q = map(int, input().split())
a = [i+1 for i in range(n)]
first = 0
for _ in range(q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        p, x = query[1:]
        p -= 1
        a[(p + first) % n] = x
    elif query[0] == 2:
        p = query[-1] - 1
        print(a[(p + first) % n])
    else:
        first += query[-1]
        first %= n

Submission Info

Submission Time
Task C - Rotatable Array
User juten
Language Python (CPython 3.11.4)
Score 300
Code Size 382 Byte
Status AC
Exec Time 1083 ms
Memory 48180 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 46
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt
Case Name Status Exec Time Memory
sample_01.txt AC 10 ms 8500 KiB
sample_02.txt AC 59 ms 48020 KiB
test_01.txt AC 9 ms 8380 KiB
test_02.txt AC 10 ms 8540 KiB
test_03.txt AC 9 ms 8524 KiB
test_04.txt AC 712 ms 48160 KiB
test_05.txt AC 698 ms 48108 KiB
test_06.txt AC 736 ms 48168 KiB
test_07.txt AC 700 ms 48144 KiB
test_08.txt AC 710 ms 48076 KiB
test_09.txt AC 723 ms 48164 KiB
test_10.txt AC 472 ms 8428 KiB
test_11.txt AC 519 ms 8476 KiB
test_12.txt AC 470 ms 9556 KiB
test_13.txt AC 988 ms 12684 KiB
test_14.txt AC 745 ms 48180 KiB
test_15.txt AC 603 ms 8488 KiB
test_16.txt AC 673 ms 8624 KiB
test_17.txt AC 857 ms 9560 KiB
test_18.txt AC 524 ms 30236 KiB
test_19.txt AC 546 ms 48120 KiB
test_20.txt AC 940 ms 8444 KiB
test_21.txt AC 637 ms 8448 KiB
test_22.txt AC 637 ms 9448 KiB
test_23.txt AC 516 ms 9976 KiB
test_24.txt AC 837 ms 48176 KiB
test_25.txt AC 891 ms 8488 KiB
test_26.txt AC 414 ms 8492 KiB
test_27.txt AC 940 ms 9036 KiB
test_28.txt AC 703 ms 24448 KiB
test_29.txt AC 736 ms 48120 KiB
test_30.txt AC 497 ms 8688 KiB
test_31.txt AC 703 ms 8488 KiB
test_32.txt AC 892 ms 9184 KiB
test_33.txt AC 458 ms 30824 KiB
test_34.txt AC 1083 ms 48172 KiB
test_35.txt AC 600 ms 8456 KiB
test_36.txt AC 612 ms 8476 KiB
test_37.txt AC 479 ms 9288 KiB
test_38.txt AC 996 ms 11080 KiB
test_39.txt AC 606 ms 48128 KiB
test_40.txt AC 386 ms 8424 KiB
test_41.txt AC 940 ms 8532 KiB
test_42.txt AC 640 ms 9800 KiB
test_43.txt AC 743 ms 46028 KiB
test_44.txt AC 743 ms 48160 KiB
Facebook Twitter Telegram Share

2025-06-14 (Sat)
22:43:40 +09:00

More…