Submission #66751167

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <numeric>
using namespace std;
#define ll long long
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vii vector <<int>, <int>>
#define vllvector <<ll>, <ll>>
#define vb vector<bool>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define rep(i, n) for (int i = 0; i < n; i++)

void query(int n, int q, vi& box) {
    int offset = 0;

    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int location, change;
            cin >> location >> change;
            location--;
            box[(location + offset) % n] = change;
        } else if (type == 2) {
            int location;
            cin >> location;
            location--;
            cout << box[(location + offset) % n] << endl;
        } else if (type == 3) {
            int k;
            cin >> k;
            offset = (offset + k) % n;
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;
    vi box(n);
    rep(i, n) box[i] = i + 1;

    query(n, q, box);

    return 0;
}

Submission Info

Judge Result