oj.uz

Submission #1004935

# Submission time Handle Problem Language Result Execution time Memory
1004935 2024-06-22T04:34:20 Z pavement Flooding Wall (BOI24_wall) C++17
70 / 100
 2141 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define pb push_back

const int MOD = (int)1e9 + 7, INV_2 = (MOD + 1) / 2, LIM = (int)1e9;
int N, glob, a[500005], b[500005], pf_a[500005], sf_a[500005];

int exp_mod(int a, int b) {
	int r = 1;
	while (b) {
		if (b % 2 == 1) {
			r = (ll)r * a % MOD;
		}
		a = (ll)a * a % MOD;
		b /= 2;
	}
	return r;
}

struct node {
	node *left, *right;
	int S, E, val, pv;
	node(int _s, int _e) : left(nullptr), right(nullptr), S(_s), E(_e), val(E - S + 1), pv(1) {}
	void cc() {
		if (left == nullptr) {
			int M = (S + E) / 2;
			left = new node(S, M);
			right = new node(M + 1, E);
		}
	}
	void prop() {
		cc();
		if (pv == 1) {
			return;
		}
		left->val = ((ll)left->val * pv) % MOD;
		left->pv = ((ll)left->pv * pv) % MOD;
		right->val = ((ll)right->val * pv) % MOD;
		right->pv = ((ll)right->pv * pv) % MOD;
		pv = 1;
	}
	void mul(int l, int r, int v) {
		if (l > E || r < S) {
			return;
		}
		if (l <= S && E <= r) {
			val = ((ll)val * v) % MOD;
			pv = ((ll)pv * v) % MOD;
			return;
		}
		prop();
		left->mul(l, r, v);
		right->mul(l, r, v);
		val = (left->val + right->val) % MOD;
	}
	int sum(int l, int r) {
		if (l > E || r < S) {
			return 0;
		}
		if (l <= S && E <= r) {
			return val;
		}
		prop();
		return (left->sum(l, r) + right->sum(l, r)) % MOD;
	}
} *root[3];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= N; i++) {
		cin >> b[i];
		if (a[i] > b[i]) {
			swap(a[i], b[i]);
		}
	}
	root[0] = new node(1, LIM + 1);
	root[1] = new node(1, LIM + 1);
	root[2] = new node(1, LIM + 1);
	for (int i = 1; i <= N; i++) {
		root[1]->mul(1, b[i], INV_2);
		root[2]->mul(1, b[i], INV_2);
		pf_a[i] = max(a[i], pf_a[i - 1]);
	}
	for (int i = N; i >= 1; i--) {
		sf_a[i] = max(a[i], sf_a[i + 1]);
	}
	for (int i = 1; i <= N; i++) {
		root[1]->mul(1, b[i], 2);
		root[2]->mul(1, b[i], 2);
		for (int h : {a[i], b[i]}) {
			int max_p_a = pf_a[i - 1], max_s_a = sf_a[i + 1];
			if (max_p_a <= max_s_a) {
				glob = (glob + max(0, max_p_a - h)) % MOD;
				glob = (glob + max(0, max_s_a - (max(h, max_p_a) + 1) + 1)) % MOD;
				glob = (glob - root[0]->sum(max(h, max_p_a) + 1, LIM + 1) + MOD) % MOD;
				
				glob = (glob + max(0, LIM + 1 - (max(h, max_s_a) + 1) + 1)) % MOD;
				glob = (glob - root[1]->sum(max(h, max_s_a) + 1, LIM + 1) + MOD) % MOD;
				
				glob = (glob + root[2]->sum(max(h, max_s_a) + 1, LIM + 1)) % MOD;
			} else {
				glob = (glob + max(0, max_s_a - h)) % MOD;
				glob = (glob + max(0, max_p_a - (max(h, max_s_a) + 1) + 1)) % MOD;
				glob = (glob - root[1]->sum(max(h, max_s_a) + 1, LIM + 1) + MOD) % MOD;
				
				glob = (glob + max(0, LIM + 1 - (max(h, max_p_a) + 1) + 1)) % MOD;
				glob = (glob - root[0]->sum(max(h, max_p_a) + 1, LIM + 1) + MOD) % MOD;
				
				glob = (glob + root[2]->sum(max(h, max_p_a) + 1, LIM + 1)) % MOD;
			}
		}
		root[0]->mul(1, b[i], INV_2);
		root[2]->mul(1, b[i], INV_2);
	}
	for (int rep = 0; rep < N - 1; rep++) {
		glob = (glob * 2) % MOD;
	}
	cout << glob << '\n';
}

Subtask #1
8.0 / 8.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 29 ms 856 KB Output is correct
28 Correct 29 ms 860 KB Output is correct
29 Correct 26 ms 604 KB Output is correct
30 Correct 25 ms 688 KB Output is correct
31 Correct 25 ms 708 KB Output is correct
32 Correct 25 ms 604 KB Output is correct
33 Correct 26 ms 480 KB Output is correct
34 Correct 25 ms 604 KB Output is correct
35 Correct 25 ms 604 KB Output is correct
36 Correct 26 ms 604 KB Output is correct
37 Correct 25 ms 600 KB Output is correct
38 Correct 25 ms 604 KB Output is correct
39 Correct 26 ms 648 KB Output is correct
40 Correct 26 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 464 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 460 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 29 ms 856 KB Output is correct
50 Correct 29 ms 860 KB Output is correct
51 Correct 26 ms 604 KB Output is correct
52 Correct 25 ms 688 KB Output is correct
53 Correct 25 ms 708 KB Output is correct
54 Correct 25 ms 604 KB Output is correct
55 Correct 26 ms 480 KB Output is correct
56 Correct 25 ms 604 KB Output is correct
57 Correct 25 ms 604 KB Output is correct
58 Correct 26 ms 604 KB Output is correct
59 Correct 25 ms 600 KB Output is correct
60 Correct 25 ms 604 KB Output is correct
61 Correct 26 ms 648 KB Output is correct
62 Correct 26 ms 604 KB Output is correct
63 Correct 77 ms 44372 KB Output is correct
64 Correct 77 ms 44368 KB Output is correct
65 Correct 29 ms 600 KB Output is correct
66 Correct 25 ms 604 KB Output is correct
67 Correct 29 ms 600 KB Output is correct
68 Correct 25 ms 604 KB Output is correct
69 Correct 59 ms 25492 KB Output is correct
70 Correct 59 ms 25428 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 26 ms 600 KB Output is correct
11 Correct 24 ms 600 KB Output is correct
12 Correct 23 ms 604 KB Output is correct
13 Correct 23 ms 628 KB Output is correct
14 Correct 1163 ms 9812 KB Output is correct
15 Correct 1171 ms 10064 KB Output is correct
16 Correct 1250 ms 9996 KB Output is correct
17 Correct 1244 ms 10320 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 464 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 460 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 29 ms 856 KB Output is correct
50 Correct 29 ms 860 KB Output is correct
51 Correct 26 ms 604 KB Output is correct
52 Correct 25 ms 688 KB Output is correct
53 Correct 25 ms 708 KB Output is correct
54 Correct 25 ms 604 KB Output is correct
55 Correct 26 ms 480 KB Output is correct
56 Correct 25 ms 604 KB Output is correct
57 Correct 25 ms 604 KB Output is correct
58 Correct 26 ms 604 KB Output is correct
59 Correct 25 ms 600 KB Output is correct
60 Correct 25 ms 604 KB Output is correct
61 Correct 26 ms 648 KB Output is correct
62 Correct 26 ms 604 KB Output is correct
63 Correct 77 ms 44372 KB Output is correct
64 Correct 77 ms 44368 KB Output is correct
65 Correct 29 ms 600 KB Output is correct
66 Correct 25 ms 604 KB Output is correct
67 Correct 29 ms 600 KB Output is correct
68 Correct 25 ms 604 KB Output is correct
69 Correct 59 ms 25492 KB Output is correct
70 Correct 59 ms 25428 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 468 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 26 ms 600 KB Output is correct
81 Correct 24 ms 600 KB Output is correct
82 Correct 23 ms 604 KB Output is correct
83 Correct 23 ms 628 KB Output is correct
84 Correct 1163 ms 9812 KB Output is correct
85 Correct 1171 ms 10064 KB Output is correct
86 Correct 1250 ms 9996 KB Output is correct
87 Correct 1244 ms 10320 KB Output is correct
88 Runtime error 2141 ms 1048576 KB Execution killed with signal 9
89 Halted 0 ms 0 KB -