답안 #937075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937075 2024-03-03T11:25:37 Z lionqu Tracks in the Snow (BOI13_tracks) C++14
100 / 100
419 ms 130912 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 3932 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 5 ms 3420 KB Output is correct
5 Correct 2 ms 1948 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 856 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 4 ms 2140 KB Output is correct
13 Correct 3 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 7 ms 3672 KB Output is correct
16 Correct 9 ms 3932 KB Output is correct
17 Correct 6 ms 3676 KB Output is correct
18 Correct 6 ms 3828 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 28 ms 11860 KB Output is correct
3 Correct 151 ms 75520 KB Output is correct
4 Correct 47 ms 29520 KB Output is correct
5 Correct 120 ms 51772 KB Output is correct
6 Correct 419 ms 110036 KB Output is correct
7 Correct 9 ms 16728 KB Output is correct
8 Correct 9 ms 15960 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 16216 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 27 ms 11932 KB Output is correct
14 Correct 16 ms 8024 KB Output is correct
15 Correct 12 ms 10336 KB Output is correct
16 Correct 13 ms 4956 KB Output is correct
17 Correct 74 ms 25172 KB Output is correct
18 Correct 57 ms 32140 KB Output is correct
19 Correct 42 ms 29520 KB Output is correct
20 Correct 37 ms 22612 KB Output is correct
21 Correct 90 ms 50664 KB Output is correct
22 Correct 113 ms 52052 KB Output is correct
23 Correct 134 ms 42320 KB Output is correct
24 Correct 89 ms 47744 KB Output is correct
25 Correct 291 ms 96556 KB Output is correct
26 Correct 234 ms 130912 KB Output is correct
27 Correct 310 ms 123240 KB Output is correct
28 Correct 395 ms 110044 KB Output is correct
29 Correct 402 ms 108456 KB Output is correct
30 Correct 365 ms 112600 KB Output is correct
31 Correct 324 ms 72020 KB Output is correct
32 Correct 276 ms 108448 KB Output is correct