Submission #34003010

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n, m;
char arr[2010][2010];
long long r[2010];
long long c[2010];
long long dp[2010][2010][4];

int main()
{
	int i, j, k;

	cin >> n >> m;
	for (i = 0; i < n; i++)
	{
		cin >> r[i];
	}
	for (i = 0; i < m; i++)
	{
		cin >> c[i];
	}
	for (i = 0; i < n; i++)
	{
		cin >> arr[i];
	}

	memset(dp, 50, sizeof(dp));

	dp[0][0][0] = 0;
	dp[0][0][1] = c[0];
	dp[0][0][2] = r[0];
	dp[0][0][3] = c[0] + r[0];
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
		{
			if (i == 0 && j == 0) continue;

			for (k = 0; k < 4; k++)
			{
				if (i != 0)
				{
					if (arr[i - 1][j] == arr[i][j]) dp[i][j][k] = dp[i - 1][j][k] + ((k & 2) != 0) * r[i];
					else dp[i][j][k] = dp[i - 1][j][k ^ 2] + ((k & 2) != 0) * r[i];
				}
				if (j != 0)
				{
					if (arr[i][j - 1] == arr[i][j]) dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k] + (k & 1) * c[j]);
					else dp[i][j][k] = min(dp[i][j][k], dp[i][j - 1][k ^ 1] + (k & 1) * c[j]);
				}
			}
		}
	}

	cout << min(min(dp[n - 1][m - 1][0], dp[n - 1][m - 1][1]), min(dp[n - 1][m - 1][2], dp[n - 1][m - 1][3]));
}

Submission Info

Judge Result