Submission #66730717

---

Source Code Expand

// Author: Andimeo
// Date: 2025-6-14 19:44:58

#include<bits/stdc++.h>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define tc int tt, qq = 0; cin >> tt; while(qq++ < tt)
#define cs cout << "Case " << qq << ": "
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using hash_t = uint64_t;

void solve() {
    int n, q; cin >> n >> q;
    vector<int> a(n);
    iota(all(a), 1LL);
    int offset = 0;
    while (q--) {
        int op; cin >> op;
        if (op == 1) {
            int p, x; cin >> p >> x; p--;
            a[(p + offset) % n] = x;
        } else if (op == 2) {
            int p; cin >> p; p--;
            cout << a[(p + offset) % n] << endl;
        } else {
            int k; cin >> k;
            offset = (offset + k) % n;
        }
    }
}

signed main() {
    speed
    //tc {
        solve();
    //}
    return 0;
}

Submission Info

Judge Result