Submission #1237716

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237716		kaiboy	Wall (CEOI14_wall)	C++20	100 / 100	309 ms	56576 KiB

wall

// https://ceoi2014.informatik-olympiade.de/wp-content/uploads/2014/06/wall-spoiler.pdf
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

const       int   N = 400;
const       int   M = 400;
const       int  N_ = (N + 1 << 1) * (M + 1 << 1);
const       int  M_ = N * M * 4 + N * (M + 1) * 2 + (N + 1) * M * 2;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;

bool aa[N][M]; int wwi[N][M + 1], wwj[N + 1][M];
bool used[N + 1][M + 1], cut[N + 1][M + 1][4];
int ij[M_], ww[M_], m_; vector<int> eh[N_];
long long dd[N_]; int hh[N_], pq[N_], iq[N_ + 1], cnt;

void add(int i, int j, int w) {
	int h = m_++;
	ij[h] = i ^ j, ww[h] = w;
	eh[i].push_back(h);
	eh[j].push_back(h);
}

bool lt(int i, int j) {
	return dd[i] < dd[j];
}

int p2(int p) {
	return (p <<= 1) > cnt ? 0 : p + lt(iq[p ^ 1], iq[p]);
}

void pq_up(int i) {
	int j, p, q;
	for (p = pq[i]; (q = p >> 1) && lt(i, j = iq[q]); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_dn(int i) {
	int j, p, q;
	for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_add_last(int i) {
	iq[pq[i] = ++cnt] = i;
}

int pq_remove_first() {
	int i = iq[1], j = iq[cnt--];
	if (i != j)
		pq[j] = 1, pq_dn(j);
	pq[i] = 0;
	return i;
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	int n, m; cin >> n >> m;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			cin >> aa[i][j];
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= m; j++)
			cin >> wwi[i][j];
	for (int i = 0; i <= n; i++)
		for (int j = 0; j < m; j++)
			cin >> wwj[i][j];
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= m; j++)
			add(i * (m + 1) + j, (i + 1) * (m + 1) + j, wwi[i][j]);
	for (int i = 0; i <= n; i++)
		for (int j = 0; j < m; j++)
			add(i * (m + 1) + j, i * (m + 1) + (j + 1), wwj[i][j]);
	for (int i = 0; i < (n + 1) * (m + 1); i++)
		dd[i] = INF;
	dd[0] = 0, pq_add_last(0);
	while (cnt) {
		int i = pq_remove_first();
		for (int h : eh[i]) {
			int j = i ^ ij[h];
			long long d = dd[i] + ww[h];
			if (dd[j] > d) {
				if (dd[j] == INF)
					pq_add_last(j);
				dd[j] = d, hh[j] = h, pq_up(j);
			}
		}
	}
	for (int i = 0; i < (n + 1) * (m + 1); i++)
		eh[i].clear();
	cut[0][0][0] = cut[0][0][1] = true;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (aa[i][j]) {
				cut[i    ][j    ][2] = cut[i    ][j    ][3] = true;
				cut[i + 1][j    ][0] = cut[i + 1][j    ][3] = true;
				cut[i    ][j + 1][2] = cut[i    ][j + 1][1] = true;
				cut[i + 1][j + 1][0] = cut[i + 1][j + 1][1] = true;
			}
	used[0][0] = true;
	for (int is = 0; is < n; is++)
		for (int js = 0; js < m; js++)
			if (aa[is][js])
				for (int u = is * (m + 1) + js, i = is, j = js; !used[i][j]; ) {
					int h = hh[u], u_ = u ^ ij[h], i_ = u_ / (m + 1), j_ = u_ % (m + 1);
					if (i != i_) {
						if (i > i_)
							cut[i][j][0] = cut[i_][j_][2] = true;
						else
							cut[i][j][2] = cut[i_][j_][0] = true;
					} else {
						if (j > j_)
							cut[i][j][1] = cut[i_][j_][3] = true;
						else
							cut[i][j][3] = cut[i_][j_][1] = true;
					}
					used[i][j] = true, u = u_, i = i_, j = j_;
				}
	m_ = 0;
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= m; j++) {
			add((i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 0), (i + 1 << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 0), wwi[i][j]);
			add((i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 1), (i + 1 << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 1), wwi[i][j]);
		}
	for (int i = 0; i <= n; i++)
		for (int j = 0; j < m; j++) {
			add((i << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 1), (i << 1 ^ 0) * (m + 1 << 1) + (j + 1 << 1 ^ 0), wwj[i][j]);
			add((i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 1), (i << 1 ^ 1) * (m + 1 << 1) + (j + 1 << 1 ^ 0), wwj[i][j]);
		}
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= m; j++) {
			if (!cut[i][j][0])
				add((i << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 0), (i << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 1), 0);
			if (!cut[i][j][1])
				add((i << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 0), (i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 0), 0);
			if (!cut[i][j][2])
				add((i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 0), (i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 1), 0);
			if (!cut[i][j][3])
				add((i << 1 ^ 0) * (m + 1 << 1) + (j << 1 ^ 1), (i << 1 ^ 1) * (m + 1 << 1) + (j << 1 ^ 1), 0);
		}
	for (int i = 0; i < (n + 1 << 1) * (m + 1 << 1); i++)
		dd[i] = INF;
	dd[1] = 0, pq_add_last(1);
	while (cnt) {
		int i = pq_remove_first();
		for (int h : eh[i]) {
			int j = i ^ ij[h];
			long long d = dd[i] + ww[h];
			if (dd[j] > d) {
				if (dd[j] == INF)
					pq_add_last(j);
				dd[j] = d, pq_up(j);
			}
		}
	}
	cout << dd[m + 1 << 1] << '\n';
	return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40