oj.uz

Submission #561725

# Submission time Handle Problem Language Result Execution time Memory
561725 2022-05-13T12:06:35 Z DanShaders Fish 2 (JOI22_fish2) C++17
25 / 100
 4000 ms 16696 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
 
namespace x = __gnu_pbds;
template <typename T>
using ordered_set = x::tree<T, x::null_type, less<T>, x::rb_tree_tag, x::tree_order_statistics_node_update>;
 
template <typename T>
using normal_queue = priority_queue<T, vector<T>, greater<>>;
 
#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())
#define x first
#define y second
using ll = long long;
using ld = long double;
 
const int N = 1 << 17, INF = 0x3f3f3f3f;
 
pair<int, int> t[2 * N];
int mod[2 * N];
 
pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
	if (a.x == b.x) {
		return {a.x, a.y + b.y};
	}
	return min(a, b);
}
 
void tapply(int i, int x) {
	t[i].x += x;
	mod[i] += x;
}
 
void tpush(int i) {
	if (mod[i]) {
		tapply(2 * i + 1, mod[i]);
		tapply(2 * i + 2, mod[i]);
		mod[i] = 0;
	}
}
 
void tpull(int i) {
	t[i] = merge(t[2 * i + 1], t[2 * i + 2]);
}
 
void tadd(int ql, int qr, int x, int ci = 0, int cl = 0, int cr = N) {
	if (ql <= cl && cr <= qr) {
		tapply(ci, x);
		return;
	}
	if (qr <= cl || cr <= ql) {
		return;
	}
	int mid = (cl + cr) / 2;
	tpush(ci);
	tadd(ql, qr, x, 2 * ci + 1, cl, mid);
	tadd(ql, qr, x, 2 * ci + 2, mid, cr);
	tpull(ci);
}
 
pair<int, int> tget(int ql, int qr, int ci = 0, int cl = 0, int cr = N) {
	if (ql <= cl && cr <= qr) {
		return t[ci];
	}
	if (qr <= cl || cr <= ql) {
		return {+INF, 0};
	}
	int mid = (cl + cr) / 2;
	tpush(ci);
	return merge(
		tget(ql, qr, 2 * ci + 1, cl, mid),
		tget(ql, qr, 2 * ci + 2, mid, cr)
	);
}
 
pair<int, int> g[2 * N];
ll gs[2 * N];
 
void gset(int i, int x) {
	i += N;
	g[i] = {x, i};
	gs[i] = x;
	i /= 2;
	while (i) {
		g[i] = max(g[2 * i], g[2 * i + 1]);
		gs[i] = gs[2 * i] + gs[2 * i + 1];
		i /= 2;
	}
}
 
pair<int, int> gget(int l, int r) {
	l += N, r += N - 1;
	pair<int, int> ans = {-1, -1};
	while (l <= r) {
		if (l & 1)	ans = max(ans, g[l]);
		if (!(r & 1))	ans = max(ans, g[r]);
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
	return ans;
}
 
ll gsum(int l, int r) {
	l += N, r += N - 1;
	ll ans = 0;
	while (l <= r) {
		if (l & 1)	ans += gs[l];
		if (!(r & 1))	ans += gs[r];
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
	return ans;
}
 
int gfirstgreater(int ql, int qr, ll x, int ci = 1, int cl = 0, int cr = N) {
	if (qr <= cl || cr <= ql || g[ci].x <= x) {
		return qr;
	}
	if (cr - cl == 1) {
		return cl;
	}
	int mid = (cl + cr) / 2;
	int res = gfirstgreater(ql, qr, x, 2 * ci, cl, mid);
	if (res >= qr) {
		return gfirstgreater(ql, qr, x, 2 * ci + 1, mid, cr);
	} else {
		return res;
	}
}
 
int glastgreater(int ql, int qr, ll x, int ci = 1, int cl = 0, int cr = N) {
	if (qr <= cl || cr <= ql || g[ci].x <= x) {
		return ql - 1;
	}
	if (cr - cl == 1) {
		return cl;
	}
	int mid = (cl + cr) / 2;
	int res = glastgreater(ql, qr, x, 2 * ci + 1, mid, cr);
	if (res < ql) {
		return glastgreater(ql, qr, x, 2 * ci, cl, mid);
	} else {
		return res;
	}
}
 
int a[N], n;
int up[N], left_[N], right_[N];
 
void set_up_to(int i, int x) {
	if (up[i] != x) {
		up[i] = x;
		if (!x) {
			tadd(left_[i] + 1, right_[i], -1);
		} else {
			tadd(left_[i] + 1, right_[i], 1);
		}
	}
}
 
void loop_set_up(int u, int l, int r, int x, vector<pair<int, int>> &change) {
	assert(l <= u && u < r);
	auto ai = [&](int i) {
		if (i < l || i >= r) {
			return +INF;
		}
		return a[i];
	};
 
	int cl = max(left_[u], l - 1), cr = min(right_[u], r);
	ll sm = gsum(cl + 1, cr);
	// cout << "loop_set_up" << u << " " << l << " " << r << " " << x << endl;
	while (cl != l - 1 || cr != r) {
		// cout << cl << " " << cr << " " << sm << endl;
		if (sm < min(ai(cl), ai(cr))) {
			int v = gget(cl + 1, cr).y;
			change.push_back({v, x});
			// cout << "set up to " << u << " " << x << endl;
			if (ai(cl) <= ai(cr)) {
				sm += a[cl];
				--cl;
			} else {
				sm += a[cr];
				++cr;
			}
		}
		cl = glastgreater(l, cl + 1, sm);
		cr = gfirstgreater(cr - 1, r, sm);
		// cout << "got new sum " << sm << " " << cl << " " << cr << endl;
		sm = gsum(cl + 1, cr);
	}
}
 
int ai(int i) {
	if (i < 0 || i >= n) {
		return +INF;
	}
	return a[i];
}
 
vector<pair<int, int>> change;

int query(int l, int r) {
	change.clear();

	if (l) {
		loop_set_up(l, 0, n, 0, change);
		loop_set_up(l, l, r, 1, change);
	}
	if (r != n) {
		loop_set_up(r - 1, 0, n, 0, change);
		loop_set_up(r - 1, l, r, 1, change);
	}

	stable_sort(all(change), [](auto x, auto y) {
		return x.x < y.x;
	});
	reverse(all(change));
	change.resize(unique(all(change), [](auto x, auto y) {
		return x.x == y.x;
	}) - begin(change));

	assert(sz(change) < 120);

	for (auto &[where, what] : change) {
		int backup = up[where];
		set_up_to(where, what);
		what = backup;
	}
	auto [ansx, ansy] = tget(l, r);
	for (auto [where, what] : change) {
		set_up_to(where, what);
	}
	return ansx ? 0 : ansy;
}

ll pref[N];
pair<int, int> go[N];
int balance[N];
 
int get(int *a, int n) {
	for (int i = 0; i < n; ++i) {
		pref[i + 1] = pref[i] + a[i];
	}
	for (int i = 0; i < n; ++i) {
		left_[i] = i - 1;
		while (left_[i] >= 0 && pair{a[left_[i]], left_[i]} < pair{a[i], i}) {
			left_[i] = left_[left_[i]];
		}
	}
	for (int i = n; i--; ) {
		right_[i] = i + 1;
		while (right_[i] < n && pair{a[right_[i]], right_[i]} < pair{a[i], i}) {
			right_[i] = right_[right_[i]];
		}
	}
	fill(balance, balance + n + 1, 0);
	
	auto ai = [&](int i) {
		if (i < 0 || i >= n) {
			return +INF;
		}
		return a[i];
	};
 
	for (int i = 0; i < n; ++i) {
		int lef = left_[i], rig = right_[i];
		if (pref[rig] - pref[lef + 1] < min(ai(lef), ai(rig)) && (lef != -1 || rig != n)) {
			++balance[lef + 1];
			--balance[rig];
		}
	}
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		balance[i + 1] += balance[i];
		if (!balance[i]) {
			++ans;
		}
	}
	return ans;
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		g[N + i] = {a[i], i};
		gs[N + i] = a[i];
	}

	for (int i = 0; i < n; ++i) {
		t[N - 1 + i] = {0, 1};
	}
	for (int i = N - 1; i--; ) {
		t[i] = merge(t[2 * i + 1], t[2 * i + 2]);
		mod[i] = 0;
	}
	for (int i = N; i--; ) {
		g[i] = max(g[2 * i], g[2 * i + 1]);
		gs[i] = gs[2 * i] + gs[2 * i + 1];
	}
 
	for (int i = 0; i < n; ++i) {
		left_[i] = glastgreater(0, i, a[i]);
		right_[i] = gfirstgreater(i + 1, n, a[i] - 1);
		if (gsum(left_[i] + 1, right_[i]) < min(ai(left_[i]), ai(right_[i])) &&
			(left_[i] != -1 || right_[i] != n)) {
			set_up_to(i, 1);
		}
	}
 
	int queries;
	cin >> queries;

	if (queries <= 1000) {
		while (queries--) {
			int type, l, r;
			cin >> type >> l >> r;
			if (type == 1) {
				a[l - 1] = r;
			} else {
				cout << get(a + l - 1, r - l + 1) << "\n";
			}
		}
		return 0;
	}

	while (queries--) {
		int type, l, r;
		cin >> type >> l >> r;
		if (type == 1) {
			// a[l - 1] = r;
			// gset(l - 1, r);
			assert(0);
		} else {
			cout << query(l - 1, r) << "\n";
		}
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 3 ms 3924 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 3 ms 3924 KB Output is correct
5 Correct 4 ms 3924 KB Output is correct
6 Correct 4 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 4 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 4 ms 3924 KB Output is correct
11 Correct 5 ms 3924 KB Output is correct
12 Correct 4 ms 3976 KB Output is correct
13 Correct 5 ms 3924 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 4 ms 3924 KB Output is correct
16 Correct 4 ms 3924 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 5 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 5 ms 3924 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 64 ms 9336 KB Output is correct
3 Correct 65 ms 9312 KB Output is correct
4 Correct 66 ms 9308 KB Output is correct
5 Correct 62 ms 9404 KB Output is correct
6 Correct 52 ms 9388 KB Output is correct
7 Correct 48 ms 9372 KB Output is correct
8 Correct 57 ms 9344 KB Output is correct
9 Correct 47 ms 9316 KB Output is correct
10 Correct 77 ms 9424 KB Output is correct
11 Correct 50 ms 9312 KB Output is correct
12 Correct 50 ms 9420 KB Output is correct
13 Correct 54 ms 9312 KB Output is correct
14 Correct 56 ms 9408 KB Output is correct
15 Correct 64 ms 9308 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 3 ms 3924 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 3 ms 3924 KB Output is correct
5 Correct 4 ms 3924 KB Output is correct
6 Correct 4 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 4 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 4 ms 3924 KB Output is correct
11 Correct 5 ms 3924 KB Output is correct
12 Correct 4 ms 3976 KB Output is correct
13 Correct 5 ms 3924 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 4 ms 3924 KB Output is correct
16 Correct 4 ms 3924 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 5 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 5 ms 3924 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 64 ms 9336 KB Output is correct
23 Correct 65 ms 9312 KB Output is correct
24 Correct 66 ms 9308 KB Output is correct
25 Correct 62 ms 9404 KB Output is correct
26 Correct 52 ms 9388 KB Output is correct
27 Correct 48 ms 9372 KB Output is correct
28 Correct 57 ms 9344 KB Output is correct
29 Correct 47 ms 9316 KB Output is correct
30 Correct 77 ms 9424 KB Output is correct
31 Correct 50 ms 9312 KB Output is correct
32 Correct 50 ms 9420 KB Output is correct
33 Correct 54 ms 9312 KB Output is correct
34 Correct 56 ms 9408 KB Output is correct
35 Correct 64 ms 9308 KB Output is correct
36 Correct 264 ms 9768 KB Output is correct
37 Correct 460 ms 9548 KB Output is correct
38 Correct 473 ms 9568 KB Output is correct
39 Correct 144 ms 9472 KB Output is correct
40 Correct 527 ms 9636 KB Output is correct
41 Correct 708 ms 9596 KB Output is correct
42 Correct 883 ms 9676 KB Output is correct
43 Correct 743 ms 9724 KB Output is correct
44 Correct 862 ms 9560 KB Output is correct
45 Correct 270 ms 9756 KB Output is correct
46 Correct 431 ms 9728 KB Output is correct
47 Correct 522 ms 9660 KB Output is correct
48 Correct 314 ms 9696 KB Output is correct
49 Correct 931 ms 9688 KB Output is correct
50 Correct 445 ms 9540 KB Output is correct
51 Correct 1860 ms 9772 KB Output is correct
52 Correct 1861 ms 9784 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 64 ms 9336 KB Output is correct
3 Correct 65 ms 9312 KB Output is correct
4 Correct 66 ms 9308 KB Output is correct
5 Correct 62 ms 9404 KB Output is correct
6 Correct 52 ms 9388 KB Output is correct
7 Correct 48 ms 9372 KB Output is correct
8 Correct 57 ms 9344 KB Output is correct
9 Correct 47 ms 9316 KB Output is correct
10 Correct 77 ms 9424 KB Output is correct
11 Correct 50 ms 9312 KB Output is correct
12 Correct 50 ms 9420 KB Output is correct
13 Correct 54 ms 9312 KB Output is correct
14 Correct 56 ms 9408 KB Output is correct
15 Correct 64 ms 9308 KB Output is correct
16 Correct 4 ms 3924 KB Output is correct
17 Correct 1963 ms 8676 KB Output is correct
18 Correct 1789 ms 8848 KB Output is correct
19 Correct 1976 ms 8676 KB Output is correct
20 Correct 2594 ms 8620 KB Output is correct
21 Correct 1845 ms 8764 KB Output is correct
22 Correct 1807 ms 8696 KB Output is correct
23 Correct 1905 ms 8732 KB Output is correct
24 Correct 2620 ms 8516 KB Output is correct
25 Correct 1906 ms 8728 KB Output is correct
26 Correct 2679 ms 8644 KB Output is correct
27 Correct 354 ms 8760 KB Output is correct
28 Correct 379 ms 8860 KB Output is correct
29 Correct 346 ms 8748 KB Output is correct
30 Correct 2464 ms 8680 KB Output is correct
31 Correct 2555 ms 8700 KB Output is correct
32 Execution timed out 4033 ms 8528 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 64 ms 9336 KB Output is correct
3 Correct 65 ms 9312 KB Output is correct
4 Correct 66 ms 9308 KB Output is correct
5 Correct 62 ms 9404 KB Output is correct
6 Correct 52 ms 9388 KB Output is correct
7 Correct 48 ms 9372 KB Output is correct
8 Correct 57 ms 9344 KB Output is correct
9 Correct 47 ms 9316 KB Output is correct
10 Correct 77 ms 9424 KB Output is correct
11 Correct 50 ms 9312 KB Output is correct
12 Correct 50 ms 9420 KB Output is correct
13 Correct 54 ms 9312 KB Output is correct
14 Correct 56 ms 9408 KB Output is correct
15 Correct 64 ms 9308 KB Output is correct
16 Correct 2 ms 3924 KB Output is correct
17 Runtime error 72 ms 16696 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 3 ms 3924 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 3 ms 3924 KB Output is correct
5 Correct 4 ms 3924 KB Output is correct
6 Correct 4 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 4 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 4 ms 3924 KB Output is correct
11 Correct 5 ms 3924 KB Output is correct
12 Correct 4 ms 3976 KB Output is correct
13 Correct 5 ms 3924 KB Output is correct
14 Correct 3 ms 3924 KB Output is correct
15 Correct 4 ms 3924 KB Output is correct
16 Correct 4 ms 3924 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 5 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 5 ms 3924 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 64 ms 9336 KB Output is correct
23 Correct 65 ms 9312 KB Output is correct
24 Correct 66 ms 9308 KB Output is correct
25 Correct 62 ms 9404 KB Output is correct
26 Correct 52 ms 9388 KB Output is correct
27 Correct 48 ms 9372 KB Output is correct
28 Correct 57 ms 9344 KB Output is correct
29 Correct 47 ms 9316 KB Output is correct
30 Correct 77 ms 9424 KB Output is correct
31 Correct 50 ms 9312 KB Output is correct
32 Correct 50 ms 9420 KB Output is correct
33 Correct 54 ms 9312 KB Output is correct
34 Correct 56 ms 9408 KB Output is correct
35 Correct 64 ms 9308 KB Output is correct
36 Correct 264 ms 9768 KB Output is correct
37 Correct 460 ms 9548 KB Output is correct
38 Correct 473 ms 9568 KB Output is correct
39 Correct 144 ms 9472 KB Output is correct
40 Correct 527 ms 9636 KB Output is correct
41 Correct 708 ms 9596 KB Output is correct
42 Correct 883 ms 9676 KB Output is correct
43 Correct 743 ms 9724 KB Output is correct
44 Correct 862 ms 9560 KB Output is correct
45 Correct 270 ms 9756 KB Output is correct
46 Correct 431 ms 9728 KB Output is correct
47 Correct 522 ms 9660 KB Output is correct
48 Correct 314 ms 9696 KB Output is correct
49 Correct 931 ms 9688 KB Output is correct
50 Correct 445 ms 9540 KB Output is correct
51 Correct 1860 ms 9772 KB Output is correct
52 Correct 1861 ms 9784 KB Output is correct
53 Correct 4 ms 3924 KB Output is correct
54 Correct 1963 ms 8676 KB Output is correct
55 Correct 1789 ms 8848 KB Output is correct
56 Correct 1976 ms 8676 KB Output is correct
57 Correct 2594 ms 8620 KB Output is correct
58 Correct 1845 ms 8764 KB Output is correct
59 Correct 1807 ms 8696 KB Output is correct
60 Correct 1905 ms 8732 KB Output is correct
61 Correct 2620 ms 8516 KB Output is correct
62 Correct 1906 ms 8728 KB Output is correct
63 Correct 2679 ms 8644 KB Output is correct
64 Correct 354 ms 8760 KB Output is correct
65 Correct 379 ms 8860 KB Output is correct
66 Correct 346 ms 8748 KB Output is correct
67 Correct 2464 ms 8680 KB Output is correct
68 Correct 2555 ms 8700 KB Output is correct
69 Execution timed out 4033 ms 8528 KB Time limit exceeded
70 Halted 0 ms 0 KB -