제출 #1247052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247052		kaiboy	Tracks in the Snow (BOI13_tracks)	C++20	66.46 / 100	626 ms	87600 KiB

tracks

#include <algorithm>
#include <iostream>

using namespace std;

const int    N = 4000;
const int    M = 4000;
const int  INF = 0x3f3f3f3f;
const int di[] = { -1, 1, 0, 0 };
const int dj[] = { 0, 0, -1, 1 };

char cc[N][M + 1];
int dd[N][M], qu[N * M * 2];

int main() {
	int n, m; cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> cc[i];
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			dd[i][j] = INF;
	int cnt = n; dd[0][0] = 1, qu[cnt++] = 0;
	for (int h = n; h < cnt; h++) {
		int ij = qu[h], i = ij / m, j = ij % m, d = dd[i][j];
		for (int z = 0; z < 4; z++) {
			int i_ = i + di[z], j_ = j + dj[z];
			if (0 <= i_ && i_ < n && 0 <= j_ && j_ < m && cc[i_][j_] != '.') {
				int ij_ = i_ * m + j_;
				if (cc[i][j] == cc[i_][j_]) {
					if (dd[i_][j_] > d)
						dd[i_][j_] = d, qu[h--] = ij_;
				} else {
					if (dd[i_][j_] > d + 1)
						dd[i_][j_] = d + 1, qu[cnt++] = ij_;
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (cc[i][j] != '.')
				ans = max(ans, dd[i][j]);
	cout << ans << '\n';
	return 0;
}

• Subtask 1: 18.3333 / 30
• Subtask 2: 48.125 / 70