Submission #1004925

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004925		pavement	Flooding Wall (BOI24_wall)	C++17	17 / 100	5077 ms	2936 KiB

Main

#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;
int N, glob, a[500005], b[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, init;
	node(int _s, int _e, int _init) : left(nullptr), right(nullptr), S(_s), E(_e), val((ll)(E - S + 1) * _init % MOD), pv(1), init(_init) {}
	void cc() {
		if (left == nullptr) {
			int M = (S + E) / 2;
			left = new node(S, M, init);
			right = new node(M + 1, E, init);
		}
	}
	void prop() {
		cc();
		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[2];

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, (int)1e9, 1);
	root[1] = new node(1, (int)1e9, 1);
	for (int i = 1; i <= N; i++) {
		root[1]->mul(1, b[i], INV_2);
	}
	for (int i = 1; i <= N; i++) {
		root[1]->mul(1, b[i], 2);
		for (int h : {a[i], b[i]}) {
			int max_p_a = 0, max_s_a = 0;
			for (int j = 1; j < i; j++) {
				max_p_a = max(max_p_a, a[j]);
			}
			for (int j = i + 1; j <= N; j++) {
				max_s_a = max(max_s_a, a[j]);
			}
			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, max_s_a) + MOD) % MOD;
				for (int v = max(h, max_s_a) + 1; v <= 1001; v++) {
					int cnt_rig_b = 0;
					int cnt_lft_b = 0;
					for (int j = 1; j < i; j++) {
						if (b[j] >= v) {
							cnt_lft_b++;
						}
					}
					for (int j = i + 1; j <= N; j++) {
						if (b[j] >= v) {
							cnt_rig_b++;
						}
					}
					int tmp = ((exp_mod(INV_2, cnt_lft_b + cnt_rig_b) - exp_mod(INV_2, cnt_rig_b) + MOD) % MOD - exp_mod(INV_2, cnt_lft_b) + MOD) % MOD;
					tmp = (1 + tmp) % MOD;
					glob = (glob + tmp) % 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, max_p_a) + MOD) % MOD;
				for (int v = max(h, max_p_a) + 1; v <= 1001; v++) {
					int cnt_rig_b = 0;
					int cnt_lft_b = 0;
					for (int j = 1; j < i; j++) {
						if (b[j] >= v) {
							cnt_lft_b++;
						}
					}
					for (int j = i + 1; j <= N; j++) {
						if (b[j] >= v) {
							cnt_rig_b++;
						}
					}
					int tmp = ((exp_mod(INV_2, cnt_lft_b + cnt_rig_b) - exp_mod(INV_2, cnt_rig_b) + MOD) % MOD - exp_mod(INV_2, cnt_lft_b) + MOD) % MOD;
					tmp = (1 + tmp) % MOD;
					glob = (glob + tmp) % MOD;
				}
			}
		}
		root[0]->mul(1, b[i], INV_2);
	}
	for (int rep = 0; rep < N - 1; rep++) {
		glob = (glob * 2) % MOD;
	}
	cout << glob << '\n';
}

• Subtask 1: 0 / 8
• Subtask 2: 17 / 17
• Subtask 3: 0 / 19
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 30