Submission #69658751

---

Source Code Expand

// Problem: 'C - Rotate and Sum Query'
// Contest: 'AtCoder - UNIQUE VISION Programming Contest 2024 Autumn (AtCoder Beginner Contest 425)'
// URL: 'https://atcoder.jp/contests/abc425/tasks/abc425_c'
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by competitive-companion.el (https://github.com/luishgh/competitive-companion.el)

#include <bits/stdc++.h>

using namespace std;

#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'

typedef long long ll;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;

vector<ll> pref;
int c = 0;
int n;

ll pref_sum(ll l, ll r) {
  ll ret = pref[r];
  if (l > 0) ret -= pref[l-1];
  return ret;
}

ll query(ll l, ll r) {
  l += c, r += c;
  if (l >= n) l -= n;
  if (r >= n) r -= n;
  // cerr << "DEBUG " << l << ' ' << r << endl;
  if (l <= r) {
    return pref_sum(l, r);
  } else {
    return pref_sum(l, n - 1) + pref_sum(0, r);
  }
}

int main() {_;
  int q;
  cin >> n >> q;
  pref.assign(n+1, 0);

  for (int i = 0; i < n; i++) {
    cin >> pref[i];
    if (i > 0) pref[i] += pref[i-1];
  }

  while(q--) {
    int op; cin >> op;
    if (op == 1) {
      int x; cin >> x;
      c += x;
      c %= n;
    } else {
      int l, r; cin >> l >> r;
      l--, r--;
      cout << query(l, r) << endl;
    }
  }

  return 0;
}

Submission Info

Judge Result