#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
int n,q,k;
deque<lli> segt[400001];
int lazy[400001]={};
lli qu(lli node,lli l,lli r,lli s,lli e)
{
if(r<s||l>e)
return(0);
if(lazy[node]!=0)
{
lazy[2*node+1]=min(lazy[2*node+1]+lazy[node],51);
lazy[2*node+2]=min(lazy[2*node+2]+lazy[node],51);
while(lazy[node]!=0)
{
if(k==1)
segt[node].pb(segt[node].front());
else
segt[node].pb(0);
segt[node].pop_front();
lazy[node]-=1;
if(segt[node].size()>51)
exit(1);
}
}
if(l>=s&&r<=e)
return(segt[node].front());
lli m=(l+r)/2;
lli q1=qu(2*node+1,l,m,s,e),q2=qu(2*node+2,m+1,r,s,e);
return(q1+q2);
}
void up2(lli node,lli l,lli r,lli s,lli e)
{
if(l>e||r<s)
return;
if(lazy[node]!=0)
{
lazy[2*node+1]=min(lazy[2*node+1]+lazy[node],51);
lazy[2*node+2]=min(lazy[2*node+2]+lazy[node],51);
while(lazy[node]!=0)
{
if(k==1)
segt[node].pb(segt[node].front());
else
segt[node].pb(0);
segt[node].pop_front();
lazy[node]-=1;
if(segt[node].size()>51)
exit(1);
}
}
if(l>=s&&r<=e)
{
if(k==1)
segt[node].pb(segt[node].front());
else
segt[node].pb(0);
segt[node].pop_front();
lazy[2*node+1]=min(lazy[2*node+1]+1,51);
lazy[2*node+2]=min(lazy[2*node+2]+1,51);
return;
}
lli m=(l+r)/2;
up2(2*node+1,l,m,s,e);
up2(2*node+2,m+1,r,s,e);
segt[node].clear();
qu(2*node+1,l,m,l,m);
qu(2*node+2,m+1,r,m+1,r);
while(segt[node].size()!=51)
{
segt[node].pb(segt[2*node+1].at(segt[node].size())+segt[2*node+2].at(segt[node].size()));
if(segt[node].size()>51)
exit(1);
}
}
int c=0;
void up1(lli node,lli l,lli r,lli in,lli v)
{
if(lazy[node]!=0)
{
lazy[2*node+1]=min(lazy[2*node+1]+lazy[node],51);
lazy[2*node+2]=min(lazy[2*node+2]+lazy[node],51);
while(lazy[node]!=0)
{
exit(0);
if(k==1)
segt[node].pb(segt[node].front());
else
segt[node].pb(0);
segt[node].pop_front();
lazy[node]-=1;
if(segt[node].size()>51)
exit(1);
}
}
if(l==r)
{
lazy[node]=0;
segt[node].clear();
while(segt[node].size()!=51)
{
segt[node].pb(v);
v/=k;
if(segt[node].size()>51)
exit(1);
}
return;
}
lli m=(l+r)/2;
if(in<=m)
up1(2*node+1,l,m,in,v);
else
up1(2*node+2,m+1,r,in,v);
segt[node].clear();
qu(2*node+1,l,m,l,m);
qu(2*node+2,m+1,r,m+1,r);
while(segt[node].size()!=51)
{
segt[node].pb(segt[2*node+1].at(segt[node].size())+segt[2*node+2].at(segt[node].size()));
if(segt[node].size()>51)
exit(1);
}
}
void init(lli node,lli l,lli r)
{
while(segt[node].size()!=51)
{
segt[node].pb(0);
if(segt[node].size()>51)
exit(1);
}
lli m=(l+r)/2;
if(l!=r)
{
init(2*node+1,l,m);
init(2*node+2,m+1,r);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>q>>k;
init(0,0,n-1);
for(lli i=0;i<n;++i)
{
lli f;
cin>>f;
up1(0,0,n-1,i,f);
}
for(lli i=0;i<q;++i)
{
lli f,s,t;
cin>>f>>s>>t;
if(f==1)
{
s--;
up1(0,0,n-1,s,t);
}
else if(f==2)
{
s--;
t--;
up2(0,0,n-1,s,t);
}
else
{
s--;
t--;
cout<<qu(0,0,n-1,s,t)<<endl;
}
if(sizeof(segt)/4>400001*51)
exit(1);
}
return(0);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
193 ms |
269560 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
697 ms |
270668 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
240 ms |
269688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
740 ms |
270136 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
