답안 #860822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860822 2023-10-14T12:15:44 Z shahi_45 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
402 ms 118880 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 8 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 600 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 2 ms 1628 KB Output is correct
12 Correct 3 ms 2136 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 3 ms 1884 KB Output is correct
15 Correct 7 ms 3420 KB Output is correct
16 Correct 9 ms 3672 KB Output is correct
17 Correct 6 ms 3420 KB Output is correct
18 Correct 5 ms 3420 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15964 KB Output is correct
2 Correct 26 ms 10296 KB Output is correct
3 Correct 145 ms 59840 KB Output is correct
4 Correct 42 ms 25680 KB Output is correct
5 Correct 109 ms 42812 KB Output is correct
6 Correct 394 ms 94632 KB Output is correct
7 Correct 7 ms 16476 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 26 ms 10284 KB Output is correct
14 Correct 15 ms 7004 KB Output is correct
15 Correct 11 ms 9308 KB Output is correct
16 Correct 13 ms 4440 KB Output is correct
17 Correct 68 ms 21432 KB Output is correct
18 Correct 54 ms 28240 KB Output is correct
19 Correct 42 ms 25688 KB Output is correct
20 Correct 36 ms 19036 KB Output is correct
21 Correct 88 ms 41552 KB Output is correct
22 Correct 110 ms 42836 KB Output is correct
23 Correct 131 ms 34672 KB Output is correct
24 Correct 87 ms 38688 KB Output is correct
25 Correct 265 ms 80724 KB Output is correct
26 Correct 227 ms 118880 KB Output is correct
27 Correct 295 ms 107400 KB Output is correct
28 Correct 402 ms 94308 KB Output is correct
29 Correct 394 ms 92828 KB Output is correct
30 Correct 361 ms 97340 KB Output is correct
31 Correct 317 ms 62020 KB Output is correct
32 Correct 263 ms 92556 KB Output is correct