# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476166 | quackson | Addk (eJOI21_addk) | C++11 | 130 ms | 1832 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.
#include <bits/stdc++.h>
#pragma GCC diagnostic warning "-std=c++11"
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
long long arr[n + 1];
for(int i = 1; i <= n; i++){
cin >> arr[i];
}
long long prefix[n + 1] = {0};
long long prefix2[n + 1] = {0};
for(int i = 1; i <= n; i++){
prefix[i] = prefix[i - 1] + arr[i];
prefix2[i] = prefix2[i - 1] + arr[i] * i;
}
int q;
cin >> q;
while(q--){
int oneOrTwo;
cin >> oneOrTwo;
if(oneOrTwo == 1){
int smth;
cin >> smth;
}
else{
int l, r, m;
cin >> l >> r >> m;
m = min(r - l + 2 - m, m);
int a = (prefix2[l + m - 1] - prefix2[l - 1]) - (prefix[l + m - 1] - prefix[l - 1]) * (l - 1);
int b = (prefix[r - m] - prefix[l + m - 1]) * m;
int c = (prefix[r] - prefix[r - m]) * (r + 1) - (prefix2[r] - prefix2[r - m]);
cout << a + b + c << endl;
}
}
return 0;
}
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... |