# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
476151 |
2021-09-25T05:51:33 Z |
gvancak |
Addk (eJOI21_addk) |
C++11 |
|
2000 ms |
3360 KB |
#include <iostream>
using namespace std;
long long n,k,q,a[100001],p[100001],t,x,ans,l,r,m,y;
int main()
{
cin >> n >> k;
for (int i=1; i<=n; i++){
cin >> a[i];
p[i]=p[i-1]+a[i];
}
cin >> q;
for (int o=1; o<=q; o++){
cin >> t;
ans=0;
if (t==1){
for (int i=1; i<=k; i++){
cin >> x;
}
}
else{
cin >> l >> r >> m;
if (r-l+1<m*2-1){
x=r-(l+m-1)+1;
for (int i=l; i<=l+m-1-1; i++){
if (x<=i-l+1){ y=i; break; }
ans+=min(i-l+1,x)*a[i];
}
ans+=(p[l+m-2]-p[y-1])*x;
for (int i=l+m-1-1+1; i<=r; i++){
ans+=min(r-i+1,x)*a[i];
}
cout<<ans<<endl;
}
else{
x=m;
for (int i=l; i<=l+m-1-1; i++){
ans+=min(i-l+1,x)*a[i];
}
ans+=(p[r-m]-p[l+m-1-1])*m;
for (int i=r-m+1; i<=r; i++){
ans+=min(r-i+1,x)*a[i];
}
cout<<ans<<endl;
}
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
3 ms |
332 KB |
Output is correct |
3 |
Correct |
8 ms |
332 KB |
Output is correct |
4 |
Correct |
12 ms |
332 KB |
Output is correct |
5 |
Correct |
19 ms |
492 KB |
Output is correct |
6 |
Correct |
24 ms |
484 KB |
Output is correct |
7 |
Correct |
36 ms |
576 KB |
Output is correct |
8 |
Correct |
40 ms |
580 KB |
Output is correct |
9 |
Correct |
69 ms |
708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
213 ms |
1072 KB |
Output is correct |
2 |
Correct |
433 ms |
1604 KB |
Output is correct |
3 |
Correct |
747 ms |
2228 KB |
Output is correct |
4 |
Execution timed out |
2080 ms |
3360 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
569 ms |
3200 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |