Submission #66733011

Source Code Expand

#include <iostream>
#include <cstring>

using namespace std;

int main()
{
    long long n;
    int q;
    long long add = 0;
    scanf("%lld %d", &n, &q);
    int arr[n + 100];
    for(int u = 1 ; u <= n ; u++)
        arr[u] = u;
    for(int s = 1 ; s <= q ; s++)
    {
        int type;
        long long p;
        scanf("%d %lld", &type, &p);
        if(type == 1)
        {
            int x;
            scanf("%d", &x);
            arr[(p + add - 1)%n + 1] = x;
        }
        else if(type == 2)
        {
            printf("%d\n", arr[(p + add - 1)%n + 1]);
        }
        else
        {
            add += p;
            add %= n;
        }
    }
    return 0;
}

Submission Info

Submission Time
Task C - Rotatable Array
User MichaelH
Language C++ 17 (gcc 12.2)
Score 300
Code Size 717 Byte
Status AC
Exec Time 64 ms
Memory 7772 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:11:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   11 |     scanf("%lld %d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:19:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   19 |         scanf("%d %lld", &type, &p);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   23 |             scanf("%d", &x);
      |             ~~~~~^~~~~~~~~~

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 1 ms 3652 KiB
sample_02.txt AC 2 ms 7772 KiB
test_01.txt AC 1 ms 3640 KiB
test_02.txt AC 1 ms 3652 KiB
test_03.txt AC 1 ms 3652 KiB
test_04.txt AC 55 ms 7588 KiB
test_05.txt AC 53 ms 7480 KiB
test_06.txt AC 53 ms 7712 KiB
test_07.txt AC 52 ms 7584 KiB
test_08.txt AC 53 ms 7648 KiB
test_09.txt AC 53 ms 7648 KiB
test_10.txt AC 48 ms 3760 KiB
test_11.txt AC 41 ms 3620 KiB
test_12.txt AC 47 ms 3720 KiB
test_13.txt AC 50 ms 4176 KiB
test_14.txt AC 58 ms 7580 KiB
test_15.txt AC 44 ms 3812 KiB
test_16.txt AC 47 ms 3684 KiB
test_17.txt AC 54 ms 3808 KiB
test_18.txt AC 43 ms 5736 KiB
test_19.txt AC 55 ms 7600 KiB
test_20.txt AC 39 ms 3584 KiB
test_21.txt AC 47 ms 3624 KiB
test_22.txt AC 52 ms 3676 KiB
test_23.txt AC 50 ms 3684 KiB
test_24.txt AC 64 ms 7588 KiB
test_25.txt AC 38 ms 3656 KiB
test_26.txt AC 41 ms 3656 KiB
test_27.txt AC 45 ms 3692 KiB
test_28.txt AC 56 ms 5132 KiB
test_29.txt AC 58 ms 7592 KiB
test_30.txt AC 44 ms 3692 KiB
test_31.txt AC 50 ms 3764 KiB
test_32.txt AC 46 ms 3680 KiB
test_33.txt AC 47 ms 5996 KiB
test_34.txt AC 60 ms 7652 KiB
test_35.txt AC 46 ms 3752 KiB
test_36.txt AC 47 ms 3580 KiB
test_37.txt AC 45 ms 3684 KiB
test_38.txt AC 49 ms 4024 KiB
test_39.txt AC 47 ms 7660 KiB
test_40.txt AC 39 ms 3676 KiB
test_41.txt AC 43 ms 3764 KiB
test_42.txt AC 53 ms 3772 KiB
test_43.txt AC 58 ms 7324 KiB
test_44.txt AC 61 ms 7580 KiB