提出 #34018148

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXn = 2e3;
const int MAXm = 2e3;
const int INF = 0x3f3f3f3f3f3f3f3f;

template<typename T>
inline void read(T &a) {
	char c;for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar());bool f = c == '-';T x = f ? 0 : (c ^ '0');for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) {x = x * 10 + (c ^ '0');}a = f ? -x : x;
}
template<typename T, typename ...Argv>
inline void read(T &a, Argv &...argv) {
	read(a), read(argv...);
}

int n, m;
char a[MAXn + 10][MAXm + 10];
int wein[MAXn + 10], weim[MAXm + 10];
int d[MAXn + 10][MAXm + 10][2][2];
signed main() {
	read(n, m);
	for (int i = 1; i <= n; ++i) {
		read(wein[i]);
	}
	// reverse(wein + 1, wein + 1 + n);
	for (int i = 1; i <= m; ++i) {
		read(weim[i]);
	}
	// reverse(weim + 1, weim + 1 + m);
	for (int i = 1; i <= n; ++i) {
		scanf("%s", a[i] + 1);
	}
	memset(d, 0x3f, sizeof(d));
	d[1][1][0][0] = 0;
	d[1][1][1][0] = wein[1];
	d[1][1][0][1] = weim[1];
	d[1][1][1][1] = wein[1] + weim[1];
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			// if (i + 1 <= n) {
			// 	if (a[i][j] == a[i + 1][j]) {
			// 		d[i + 1][j][0][0] = min(d[i + 1][j][0][0], d[i][j][0][0]);
			// 		d[i + 1][j][0][1] = min(d[i + 1][j][0][1], d[i][j][0][1]);
			// 		d[i + 1][j][1][0] = min(d[i + 1][j][1][0], d[i][j][1][0] + wein[i + 1]);
			// 		d[i + 1][j][1][1] = min(d[i + 1][j][1][1], d[i][j][1][1] + wein[i + 1]);
			// 	} else {
			// 		d[i + 1][j][0][0] = min(d[i + 1][j][0][0], d[i][j][1][0] + wein[i + 1]);
			// 		d[i + 1][j][0][1] = min(d[i + 1][j][0][1], d[i][j][1][1] + wein[i + 1]);
			// 		d[i + 1][j][1][0] = min(d[i + 1][j][1][0], d[i][j][0][0]);
			// 		d[i + 1][j][1][1] = min(d[i + 1][j][1][1], d[i][j][0][1]);
			// 	}
			// }
			// if (j + 1 <= m) {
			// 	if (a[i][j] == a[i][j + 1]) {
			// 		d[i][j + 1][0][0] = min(d[i][j + 1][0][0], d[i][j][0][0]);
			// 		d[i][j + 1][1][0] = min(d[i][j + 1][1][0], d[i][j][1][0]);
			// 		d[i][j + 1][0][1] = min(d[i][j + 1][0][1], d[i][j][0][1] + weim[j + 1]);
			// 		d[i][j + 1][1][1] = min(d[i][j + 1][1][1], d[i][j][1][1] + weim[j + 1]);
			// 	} else {
			// 		d[i][j + 1][0][0] = min(d[i][j + 1][0][0], d[i][j][0][1] + weim[j + 1]);
			// 		d[i][j + 1][1][0] = min(d[i][j + 1][1][0], d[i][j][1][1] + weim[j + 1]);
			// 		d[i][j + 1][0][1] = min(d[i][j + 1][0][1], d[i][j][0][0]);
			// 		d[i][j + 1][1][1] = min(d[i][j + 1][1][1], d[i][j][1][0]);
			// 	}
			// }
			if (i + 1 <= n) {
				if (a[i][j] == a[i + 1][j]) {
					d[i + 1][j][0][0] = min(d[i + 1][j][0][0], d[i][j][0][0]);
					d[i + 1][j][0][1] = min(d[i + 1][j][0][1], d[i][j][0][1]);
					d[i + 1][j][1][0] = min(d[i + 1][j][1][0], d[i][j][1][0] + wein[i + 1]);
					d[i + 1][j][1][1] = min(d[i + 1][j][1][1], d[i][j][1][1] + wein[i + 1]);
				} else {
					d[i + 1][j][0][0] = min(d[i + 1][j][0][0], d[i][j][1][0]);
					d[i + 1][j][0][1] = min(d[i + 1][j][0][1], d[i][j][1][1]);
					d[i + 1][j][1][0] = min(d[i + 1][j][1][0], d[i][j][0][0] + wein[i + 1]);
					d[i + 1][j][1][1] = min(d[i + 1][j][1][1], d[i][j][0][1] + wein[i + 1]);
				}
			}
			if (j + 1 <= m) {
				if (a[i][j] == a[i][j + 1]) {
					d[i][j + 1][0][0] = min(d[i][j + 1][0][0], d[i][j][0][0]);
					d[i][j + 1][1][0] = min(d[i][j + 1][1][0], d[i][j][1][0]);
					d[i][j + 1][0][1] = min(d[i][j + 1][0][1], d[i][j][0][1] + weim[j + 1]);
					d[i][j + 1][1][1] = min(d[i][j + 1][1][1], d[i][j][1][1] + weim[j + 1]);
				} else {
					d[i][j + 1][0][0] = min(d[i][j + 1][0][0], d[i][j][0][1]);
					d[i][j + 1][1][0] = min(d[i][j + 1][1][0], d[i][j][1][1]);
					d[i][j + 1][0][1] = min(d[i][j + 1][0][1], d[i][j][0][0] + weim[j + 1]);
					d[i][j + 1][1][1] = min(d[i][j + 1][1][1], d[i][j][1][0] + weim[j + 1]);
				}
			}
		}
	}
	int ans = min(min(min(d[n][m][0][0], d[n][m][0][1]), d[n][m][1][0]), d[n][m][1][1]);
	printf("%lld\n", ans);
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   32 |   scanf("%s", a[i] + 1);
      |   ~~~~~^~~~~~~~~~~~~~~~

ジャッジ結果