oj.uz

Submission #1012607

# Submission time Handle Problem Language Result Execution time Memory
1012607 2024-07-02T11:37:41 Z vjudge1 Sterilizing Spray (JOI15_sterilizing) C++14
100 / 100
 867 ms 11052 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int n, q, k;
 
int a[100005];
 
long long st[4 * 100005];
 
set<int> S[15];
 
void build(int id = 1, int l = 1, int r = n) {
	if (l == r) {
		st[id] = a[l];
		return;
	}
	int mid = (l + r) / 2;
	build(id * 2, l, mid);
	build(id * 2 + 1, mid + 1, r);
	st[id] = st[id * 2] + st[id * 2 + 1];
}
 
void upd(int i, int v) {
	int id = 1, l = 1, r = n;
	while (l < r) {
		int mid = (l + r) / 2;
		id *= 2;
		if (i <= mid) {
			r = mid;
		} else {
			l = mid + 1;
			id++;
		}
	}
	st[id] = v;
	while (id > 1) {
		id /= 2;
		st[id] = st[id * 2] + st[id * 2 + 1];
	}
}
 
long long get(int i, int j, int id = 1, int l = 1, int r = n) {
	if (i <= l && r <= j) {
		return st[id];
	}
	int mid = (l + r) / 2;
	if (i <= mid && mid < j) {
		return get(i, j, id * 2, l, mid) + get(i, j, id * 2 + 1, mid + 1, r);
	}
	if (mid < i) {
		return get(i, j, id * 2 + 1, mid + 1, r);
	}
	return get(i, j, id * 2, l, mid);
}
 
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> q >> k;
	
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	
	build();
	
	for (int i = 1; i <= n; ++i) {
		if (a[i]) {
			S[a[i] % k].emplace(i);		
		}
	}
	
	while (q--) {
		int s, t, u;
		cin >> s >> t >> u;
		if (s == 1) {
			S[a[t] % k].erase(t);
			a[t] = u;
			S[a[t] % k].emplace(t);
			upd(t, a[t]);
		} else if (s == 2) {
			if (k == 1) {
				continue;
			}
			vector<int> v;
			for (int i = 0; i <= k - 1; ++i) {
				set<int>::iterator it = S[i].lower_bound(t);
				while (it != S[i].end() && *it <= u) {
					v.emplace_back(*it);
					it = next(it);
				}
			}
			for (int i: v) {
				S[a[i] % k].erase(i);
				a[i] /= k;
				if (a[i]) {
					S[a[i] % k].emplace(i);
				}
				upd(i, a[i]);
			}
		} else {
			cout << get(t, u) << '\n';
		}
		cout << '\n';
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 552 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 14 ms 604 KB Output is correct
5 Correct 13 ms 792 KB Output is correct
6 Correct 9 ms 600 KB Output is correct
7 Correct 12 ms 792 KB Output is correct
8 Correct 12 ms 604 KB Output is correct
9 Correct 16 ms 604 KB Output is correct
10 Correct 11 ms 604 KB Output is correct
11 Correct 11 ms 776 KB Output is correct
12 Correct 11 ms 792 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 7504 KB Output is correct
2 Correct 41 ms 6464 KB Output is correct
3 Correct 41 ms 8528 KB Output is correct
4 Correct 58 ms 10128 KB Output is correct
5 Correct 63 ms 10580 KB Output is correct
6 Correct 63 ms 10580 KB Output is correct
7 Correct 63 ms 10704 KB Output is correct
8 Correct 65 ms 10580 KB Output is correct
9 Correct 64 ms 10580 KB Output is correct
10 Correct 68 ms 10440 KB Output is correct
11 Correct 64 ms 10576 KB Output is correct
12 Correct 61 ms 10496 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1112 KB Output is correct
2 Correct 15 ms 4192 KB Output is correct
3 Correct 20 ms 4360 KB Output is correct
4 Correct 39 ms 4700 KB Output is correct
5 Correct 58 ms 6992 KB Output is correct
6 Correct 56 ms 6876 KB Output is correct
7 Correct 50 ms 7508 KB Output is correct
8 Correct 56 ms 6844 KB Output is correct
9 Correct 49 ms 6952 KB Output is correct
10 Correct 51 ms 6784 KB Output is correct
11 Correct 51 ms 6920 KB Output is correct
12 Correct 63 ms 6920 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 7204 KB Output is correct
2 Correct 206 ms 7344 KB Output is correct
3 Correct 434 ms 6340 KB Output is correct
4 Correct 246 ms 6320 KB Output is correct
5 Correct 382 ms 10756 KB Output is correct
6 Correct 449 ms 10756 KB Output is correct
7 Correct 373 ms 11004 KB Output is correct
8 Correct 576 ms 10844 KB Output is correct
9 Correct 480 ms 10572 KB Output is correct
10 Correct 596 ms 11052 KB Output is correct
11 Correct 355 ms 10568 KB Output is correct
12 Correct 867 ms 10784 KB Output is correct