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>
#define endl '\n'
using namespace std;
const int maxn=1e5+5;
int n,k,q;
long long a[maxn],b[32];
long long tree[4*maxn];
int ql,qr;
void make_tree(int v, int l, int r)
{
if(l==r)
{
tree[v]=a[r];
return;
}
int mid=(l+r)/2;
make_tree(v*2,l,mid);
make_tree(v*2+1,mid+1,r);
tree[v]=tree[v*2]+tree[v*2+1];
}
long long query(int v, int l, int r)
{
if(r<ql||l>qr||l>r) return 0;
if(l>=ql&&r<=qr) return tree[v];
int mid=(l+r)/2;
return query(v*2,l,mid)+query(v*2+1,mid+1,r);
}
void read()
{
cin >> n >> k;
for(int i=1;i<=n;i++)
{
cin >> a[i];
}
cin >> q;
make_tree(1,1,n);
int ty,l,r,m;
for(int i=1;i<=q;i++)
{
cin >> ty;
if(ty==1)
{
for(int j=1;j<=k;j++)
{
cin >> b[j];
}
}
else
{
cin >> l >> r >> m;
long long sum=0;
long long ch=0;
int i=l;
for(i;i<m+l;i++)
{
if(!(i<=r-i+l)) break;
ql=i;
qr=i;
ch=query(1,1,n);
//cout << i << " " << ch << endl;
sum+=((i-l+1)*ch);
ql=r-i+l;
qr=r-i+l;
ch=query(1,1,n);
//cout << i << " " << ch << endl;
sum+=((i-l+1)*ch);
}
ql=i;
qr=r-i+l;
ch=0;
if(ql<=qr) ch=query(1,1,n);
//cout << ch << endl;
//cout << "++++++++++++" << endl;
sum+=(ch*m);
cout << sum << endl;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
read();
return 0;
}
/*
8 1
7 2 5 1 9 3 4 6
3
2 2 7 4
1 1
2 2 7 3
*/
Compilation message (stderr)
Main.cpp: In function 'void read()':
Main.cpp:58:17: warning: statement has no effect [-Wunused-value]
58 | for(i;i<m+l;i++)
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |