提出 #69654696

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int N, Q;

signed main() {
    cin >> N >> Q;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    vector<int> S(N);
    for (int i = 0; i < N; ++i) {
        if (i == 0) {
            S[i] = A[i];
        } else {
            S[i] = S[i - 1] + A[i];
        }
    }
    int k = 0;
    while (Q--) {
        int q;
        cin >> q;
        if (q == 1) {
            int x;
            cin >> x;
            k += x;
        } else if (q == 2) {
            int l, r;
            cin >> l >> r;
            l--, r--;
            l += k;
            r += k;
            l %= N;
            r %= N;
            if (l <= r) {
                if (l == 0) {
                    cout << S[r] << endl;
                } else {
                    cout << S[r] - S[l - 1] << endl;
                }
            } else {
                cout << S[N - 1] - S[l - 1] + S[r] << endl;
            }
        }
    }
}

提出情報

ジャッジ結果