# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767336 | ivopav | Addk (eJOI21_addk) | C++17 | 195 ms | 6704 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>
using namespace std;
int main(){
long long int n;
long long int k;
cin >> n >> k;
vector<long long int> lis={};
for (long long int i=0;i<n;i++){
long long int unos;
cin >> unos;
lis.push_back(unos);
}
vector<long long int> pref={0};
for (long long int i=0;i<n;i++){
pref.push_back(pref.back()+lis[i]);
}
vector<long long int> prefpref={0 };
//cout << "0 ";
for (long long int i=0;i<pref.size();i++){
prefpref.push_back(prefpref.back()+pref[i]);
//cout << prefpref.back() << " ";
}
// cout << "\n";
// cout << "a\n";
long long int m;
cin >> m;
for (long long int i=0;i<m;i++){
long long int vrs;
cin >> vrs;
if (vrs==2){
long long int l;
long long int r;
long long int m;
cin >> l >> r >> m;
m=min(m,(r-l+1)-m+1);
// cout << m << "\n";
cout << (prefpref[r+1]-prefpref[r-m+1])-(prefpref[l+m-1]-prefpref[l-1]) << "\n";
}
else {
int unos;
cin >> unos;
}
}
}
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... |