# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625667 | GordonRemzi007 | Addk (eJOI21_addk) | C++17 | 2076 ms | 1104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//addk
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n, k, q;
int l, r, m;
int res;
vector<int> a, temp;
string result;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> q;
a.push_back(q);
}
cin >> q;
for (int i = 0; i < q; i++) {
res = 0;
temp.clear();
cin >> n;
if (n == 1) {
for (int i = 0; i < k; i++) {
cin >> n;
temp.push_back(n);
}
for (int i = 0; i < temp.size(); i++) {
if (i + 1 == temp.size()) {
a[temp[i] - 1] = a[temp[0] - 1];
break;
}
a[temp[i] - 1] = a[temp[i + 1] - 1];
}
}
else {
cin >> l;
cin >> r;
cin >> m;
for (int i = 0; i < r - m; i++) {
for (int j = 0; j < m; j++) res += a[l + i + j - 1];
}
result.append(to_string(res).append("\n"));
}
}
cout << result;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |