제출 #1316926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1316926		boclobanchat	Sterilizing Spray (JOI15_sterilizing)	C++20	100 / 100	279 ms	2376 KiB

sterilizing

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
long long fen[MAXN],A[MAXN];
int getlog(long long n) { return 63-__builtin_clzll(n); }
void update(int i,int n,long long val) { for(;i<=n;i+=i&-i) fen[i]+=val; }
long long get(int i) { long long ans=0;for(;i;i-=i&-i) ans+=fen[i];return ans; }
int walk(int n,long long val)
{
	int ans=0;
	for(int i=getlog(n);i+1;i--) if(ans+(1<<i)<=n&&val>=fen[ans+(1<<i)]) val-=fen[ans+=(1<<i)];
	return ans+1;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,q,k;
	cin>>n>>q>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>A[i];
		update(i,n,A[i]);
	}
	for(int i=1;i<=q;i++)
	{
		int t,a,b;
		cin>>t>>a>>b;
		if(t==1)
		{
			update(a,n,b-A[a]);
			A[a]=b;
		}
		else if(t==2)
		{
			if(k==1) continue;
			long long res=get(a-1),pos;
			while((pos=walk(n,res))<=b)
			{
				update(pos,n,A[pos]/k-A[pos]);
				A[pos]/=k,res=get(pos);
			}
		}
		else cout<<get(b)-get(a-1)<<"\n";
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75