Submission #66736646

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;


void solve(){
  long long n, q;
  cin >> n >> q;
  vector<long long> a(n);
  iota(a.begin(), a.end(), 1);
  long long delta = 0;
  while(q--){
    int type;
    cin >> type;
    if(type == 1){
      long long p, x;
      cin >> p >> x;
      p--;
      a[(p - delta + n) % n] = x;
    }else if(type == 2){
      long long p;
      cin >> p;
      p--;
      cout << a[(p - delta + n) % n] << endl;
    }else{
      long long k;
      cin >> k;
      k = k % n;
      delta = (delta - k + n) % n;
    }
  }
}

int main(){ 
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << showpoint << setprecision(10);

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

Submission Info

Judge Result