Submission #66730857

Source Code Expand

/*
 * author: LostKeyToReach
 * created time: 2025-06-14 20:07:53
 */
#include <bits/stdc++.h>
#define int long long
#define vi vt<int>
using ll = long long; using pii = std::pair<int, int>;
template<typename T> using vt = std::vector<T>;
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define For(i, a, b) for(int i = (a); i <= (b); ++i)
#define Rof(i, a, b) for(int i = (a); i >= (b); --i)
#define S std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0)
template<typename T> T chkmax(T& x, T y) {
    return (x < y) ? (x = y, y) : x;
} template<typename T> T chkmin(T& x, T y) {
    return (x > y) ? (x = y, y) : x;
}int fio = (S, 0); constexpr int N = 5e5 + 5;
int32_t main() {int n, q; std::cin >> n >> q;
    vi a(n); For(i, 0, n - 1) a[i] = i + 1;
    int of = 0; while (q--) {
        int t; std::cin >> t;
        if (t == 1) {
            int p, x; std::cin >> p >> x;
            a[(of + p - 1) % n] = x;
        } else if (t == 2) {
            int p; std::cin >> p;
            std::cout << a[(of + p - 1) % n] << "\n";
        } else {
            int k; std::cin >> k;
            of = (of + k) % n;
        }
    }
}

Submission Info

Submission Time
Task C - Rotatable Array
User lkfush
Language C++ 20 (gcc 12.2)
Score 300
Code Size 1197 Byte
Status AC
Exec Time 48 ms
Memory 11100 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 1 ms 3504 KiB
sample_02.txt AC 5 ms 11040 KiB
test_01.txt AC 1 ms 3432 KiB
test_02.txt AC 1 ms 3428 KiB
test_03.txt AC 1 ms 3492 KiB
test_04.txt AC 46 ms 10944 KiB
test_05.txt AC 38 ms 10924 KiB
test_06.txt AC 48 ms 11036 KiB
test_07.txt AC 45 ms 11100 KiB
test_08.txt AC 42 ms 11028 KiB
test_09.txt AC 38 ms 10916 KiB
test_10.txt AC 29 ms 3432 KiB
test_11.txt AC 26 ms 3440 KiB
test_12.txt AC 30 ms 3428 KiB
test_13.txt AC 35 ms 3880 KiB
test_14.txt AC 39 ms 10916 KiB
test_15.txt AC 30 ms 3440 KiB
test_16.txt AC 31 ms 3456 KiB
test_17.txt AC 37 ms 3564 KiB
test_18.txt AC 30 ms 7244 KiB
test_19.txt AC 34 ms 10872 KiB
test_20.txt AC 27 ms 3500 KiB
test_21.txt AC 32 ms 3488 KiB
test_22.txt AC 33 ms 3688 KiB
test_23.txt AC 31 ms 3492 KiB
test_24.txt AC 48 ms 11028 KiB
test_25.txt AC 27 ms 3508 KiB
test_26.txt AC 25 ms 3512 KiB
test_27.txt AC 33 ms 3444 KiB
test_28.txt AC 37 ms 6212 KiB
test_29.txt AC 39 ms 10964 KiB
test_30.txt AC 29 ms 3428 KiB
test_31.txt AC 34 ms 3496 KiB
test_32.txt AC 32 ms 3440 KiB
test_33.txt AC 28 ms 7528 KiB
test_34.txt AC 43 ms 10940 KiB
test_35.txt AC 30 ms 3516 KiB
test_36.txt AC 30 ms 3568 KiB
test_37.txt AC 27 ms 3504 KiB
test_38.txt AC 33 ms 3536 KiB
test_39.txt AC 32 ms 11096 KiB
test_40.txt AC 24 ms 3564 KiB
test_41.txt AC 31 ms 3568 KiB
test_42.txt AC 33 ms 3432 KiB
test_43.txt AC 38 ms 10388 KiB
test_44.txt AC 41 ms 11044 KiB