답안 #951531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951531 2024-03-22T05:12:48 Z serpent_121 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
471 ms 118720 KB
#include <bits/stdc++.h>
using namespace std;

int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};

int n, m, depth[4000][4000], ans = 1;
string snow[4000];

bool inside(int x, int y) {
	return (x > -1 && x < n && y > -1 && y < m && snow[x][y] != '.');
}

int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> snow[i];

	deque<pair<int, int>> q;
	q.push_back({0, 0});
	depth[0][0] = 1;

	while (q.size()) {
		pair<int, int> c = q.front();
		q.pop_front();
		ans = max(ans, depth[c.first][c.second]);

		for (int i = 0; i < 4; i++) {
			int x = c.first + dx[i], y = c.second + dy[i];
			if (inside(x, y) && depth[x][y] == 0) {
				if (snow[x][y] == snow[c.first][c.second]) {
					depth[x][y] = depth[c.first][c.second];
					q.push_front({x, y});
				} else {
					depth[x][y] = depth[c.first][c.second] + 1;
					q.push_back({x, y});
				}
			}
		}
	}

	cout << ans;
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3676 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 5 ms 3420 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 2 ms 1628 KB Output is correct
12 Correct 4 ms 2140 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 7 ms 3420 KB Output is correct
16 Correct 11 ms 3920 KB Output is correct
17 Correct 7 ms 3420 KB Output is correct
18 Correct 4 ms 3420 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16216 KB Output is correct
2 Correct 33 ms 10264 KB Output is correct
3 Correct 143 ms 59724 KB Output is correct
4 Correct 48 ms 25792 KB Output is correct
5 Correct 123 ms 42836 KB Output is correct
6 Correct 471 ms 94372 KB Output is correct
7 Correct 9 ms 16920 KB Output is correct
8 Correct 7 ms 15964 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 16220 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 27 ms 10324 KB Output is correct
14 Correct 16 ms 7004 KB Output is correct
15 Correct 17 ms 9304 KB Output is correct
16 Correct 15 ms 4444 KB Output is correct
17 Correct 73 ms 21404 KB Output is correct
18 Correct 61 ms 28240 KB Output is correct
19 Correct 45 ms 25684 KB Output is correct
20 Correct 35 ms 19036 KB Output is correct
21 Correct 90 ms 41396 KB Output is correct
22 Correct 112 ms 42924 KB Output is correct
23 Correct 148 ms 34644 KB Output is correct
24 Correct 94 ms 38732 KB Output is correct
25 Correct 387 ms 80840 KB Output is correct
26 Correct 275 ms 118720 KB Output is correct
27 Correct 325 ms 107680 KB Output is correct
28 Correct 448 ms 94184 KB Output is correct
29 Correct 464 ms 92956 KB Output is correct
30 Correct 399 ms 97124 KB Output is correct
31 Correct 359 ms 62188 KB Output is correct
32 Correct 293 ms 92740 KB Output is correct