# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
501104 |
2022-01-02T11:16:24 Z |
uncripted |
Addk (eJOI21_addk) |
C++11 |
|
122 ms |
2196 KB |
#include<bits/stdc++.h>
using namespace std;
long long prefix[100005];
long long pre[100005];
int main(){
long long n,k;
cin>>n>>k;
long long a[n+1];
for(long long i=1; i<=n; i++){
cin>>a[i];
pre[i]+=pre[i-1]+a[i];
prefix[i]=prefix[i-1]+pre[i];
}
long long q;
cin>>q;
while(q--){
long long x;
cin>>x;
if(x==1){
int y;
cin>>y;
continue;
}
long long l,r,m;
cin>>l>>r>>m;
long long s=0;
s+=prefix[r]-prefix[l+m-2];
s-=prefix[r-m]-prefix[l-2];
s-=prefix[r-m];
cout<<s<<endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
50 ms |
944 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
122 ms |
2196 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |