oj.uz

Submission #776372

# Submission time Handle Problem Language Result Execution time Memory
776372 2023-07-07T18:56:52 Z Hacv16 Sterilizing Spray (JOI15_sterilizing) C++17
80 / 100
 5000 ms 3740 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

typedef long long ll;
const int MAX = 1e5 + 15;

ll n, q, k, v[MAX], seg[4 * MAX];

void build(int p, int l, int r){
	if(l == r){
		seg[p] = v[l];
		return;
	}

	int m = (l + r) >> 1, e = 2 * p, d = e + 1;
	build(e, l, m); build(d, m + 1, r);

	seg[p] = seg[e] + seg[d];
}

ll query(int a, int b, int p, int l, int r){
	if(a > r || b < l) return 0;
	if(a <= l && r <= b) return seg[p];

	int m = (l + r) >> 1, e = 2 * p, d = e + 1;
	return query(a, b, e, l, m) + query(a, b, d, m + 1, r);
}

void update(int i, ll x, int p, int l, int r){
	if(i > r || i < l) return;
	if(l == r){
		seg[p] = x;	
		return;
	}

	int m = (l + r) >> 1, e = 2 * p, d = e + 1;
	update(i, x, e, l, m); update(i, x, d, m + 1, r);

	seg[p] = seg[e] + seg[d];
}

void spray(int a, int b, int p, int l, int r){
	if(seg[p] == 0 || a > r || b < l) return;
	if(l == r){ seg[p] /= k; return; }

	int m = (l + r) >> 1, e = 2 * p, d = e + 1;
	spray(a, b, e, l, m); spray(a, b, d, m + 1, r);

	seg[p] = seg[e] + seg[d];
}

int32_t main(void){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> n >> q >> k;

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

	build(1, 1, n);

	while(q--){
		int op; cin >> op;

		if(op == 1){
			ll i, x; cin >> i >> x;
			update(i, x, 1, 1, n);

		}else if(op == 2){
			ll l, r; cin >> l >> r;
			spray(l, r, 1, 1, n);

		}else{
			ll l, r; cin >> l >> r;
			cout << query(l, r, 1, 1, n) << '\n';
		}
	}

	exit(0);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 3 ms 472 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3724 ms 2300 KB Output is correct
2 Correct 2299 ms 2012 KB Output is correct
3 Correct 3839 ms 3524 KB Output is correct
4 Execution timed out 5053 ms 3616 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 628 KB Output is correct
2 Correct 8 ms 1748 KB Output is correct
3 Correct 11 ms 1876 KB Output is correct
4 Correct 33 ms 1192 KB Output is correct
5 Correct 45 ms 3308 KB Output is correct
6 Correct 40 ms 3336 KB Output is correct
7 Execution timed out 5019 ms 3740 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2048 KB Output is correct
2 Correct 54 ms 2064 KB Output is correct
3 Correct 55 ms 1940 KB Output is correct
4 Correct 75 ms 1472 KB Output is correct
5 Correct 75 ms 3540 KB Output is correct
6 Correct 83 ms 3536 KB Output is correct
7 Correct 73 ms 3436 KB Output is correct
8 Correct 99 ms 3504 KB Output is correct
9 Correct 100 ms 3628 KB Output is correct
10 Correct 97 ms 3604 KB Output is correct
11 Correct 76 ms 3500 KB Output is correct
12 Correct 126 ms 3572 KB Output is correct