Submission #66728442

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double
#define ull unsigned long long
#define pii pair<int,int>
#define tiii tuple<int,int,int>
#define pll pair<long long, long long>
#define pdd pair<double, double>
#define s second
#define f first
#define pb push_back
#define oo 1000000000000000000ll
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), a.rend()
#define mp make_pair

void solve() {

    int n, q; cin >> n >> q;
    vector<int> a(n);
    for (int i = 1; i <= n; ++i) a[i-1] = i;

    int offset = 0;

    for (int i = 0; i < q; ++i){
        int tp; cin >> tp;
        if (tp == 1){
            int p, x; cin >> p >> x; p--;
            a[(p + offset) % n] = x;
        } else if (tp == 2){
            int p; cin >> p; p--;
            cout << a[(p + offset) % n] << "\n";
        } else {
            int k; cin >> k;
            offset += k; offset %= n;
        }
    }

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tst; tst = 1;
    //cin >> tst;
    while (tst--){
        solve();
    }

    return 0;

}

Submission Info

Judge Result