This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K, Q;
cin >> N >> K;
vector<long long> A(N), S(N + 1), S2(N + 2);
for (int i = 0; i < N; i++)
cin >> A[i];
cin >> Q;
for (int i = 0; i < N; i++)
{
S[i + 1] = S[i] + A[i];
S2[i + 2] = S2[i + 1] + S[i + 1];
}
for (int i = 0; i < Q; i++)
{
int a, l, r, m;
cin >> a;
if (a == 1)
for (int j = 0; j < K; j++)
cin >> a;
else
{
cin >> l >> r >> m;
cout << S2[r + 1] + S2[l - 1] - S2[r - m + 1] - S2[l + m - 1] << endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |