Submission #40893

#	Time	Username	Problem	Language	Result	Execution time	Memory
40893		MatheusLealV	Sterilizing Spray (JOI15_sterilizing)	C++14	100 / 100	333 ms	6060 KiB

sterilizing

#include <bits/stdc++.h>
#define N 100005
#define l (2*nod)
#define r ((2*nod) + 1)
#define mid ((a + b)/2)
using namespace std;
typedef long long ll;

int n, q, k;

ll max_tree[4*N][2], v[N];

void upd(int nod, int a, int b, int i, ll x)
{
	if(a == b) max_tree[nod][0] = max_tree[nod][1] = x;

	else
	{
		if(i <= mid) upd(l, a, mid, i, x);

		else upd(r, mid + 1, b, i, x);

		max_tree[nod][0] = max_tree[l][0] + max_tree[r][0];

		max_tree[nod][1] = max(max_tree[l][1], max_tree[r][1]);
	}
}

void upd2(int nod, int a, int b, int i, int j)
{
	if(i > b || j < a || !max_tree[nod][1]) return;

	if(a == b)
	{
		max_tree[nod][0] = max_tree[nod][1] = max_tree[nod][0] / k;

		return;
	}

	upd2(l, a, mid, i, j), upd2(r, mid + 1, b, i, j);

	max_tree[nod][0] = max_tree[l][0] + max_tree[r][0];

	max_tree[nod][1] = max(max_tree[l][1], max_tree[r][1]);
}

ll query(int nod, int a, int b, int i, int j)
{
	if(i <= a && j >= b) return max_tree[nod][0];

	if(i > b || j < a) return 0;

	return query(l, a, mid, i, j) + query(r, mid + 1, b, i, j);
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>q>>k;

	for(int i = 1; i <= n; i++) cin>>v[i], upd(1, 1, n, i, v[i]);

	for(int i = 0; i < q; i++)
	{
		ll op, a, b;

		cin>>op>>a>>b;

		if(op == 1) upd(1, 1, n, a, b);

		if(op == 2 && k >= 2) upd2(1, 1, n, a, b);

		if(op == 3) cout<<query(1, 1, n, a, b)<<"\n";
	}
}

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