Submission #69661820

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int N, Q; cin >> N >> Q;
  vector<ll> A(N); for(int i=0; i<N; i++) cin >> A[i];

  vector<ll> S(N+1);
  for (int i=0; i<N; i++) S[i+1] = S[i] + A[i];

  int offset=0;
  while(Q--){
    int type; cin >> type;
    if(type==1){
      int c; cin >> c;
       offset = (offset+c)%N;
    }else{
      int l, r; cin >> l >> r;
      int il = (offset+l-1)%N + 1;
      int ir = (offset+r-1)%N + 1;

      ll ans=0;
      if(il<=ir) ans = S[ir]-S[il-1];
      else ans = (S[N]-S[il-1])+S[ir];
      cout << ans << "\n";
    } 
  }
  return 0;
}

Submission Info

Judge Result