Submission #895548

# Submission time Handle Problem Language Result Execution time Memory
895548 2023-12-30T08:48:14 Z 123456321 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
418 ms 118764 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;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 3672 KB Output is correct
2 Correct 0 ms 856 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 5 ms 3420 KB Output is correct
5 Correct 2 ms 1880 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 860 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 2160 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 10 ms 3676 KB Output is correct
17 Correct 8 ms 3416 KB Output is correct
18 Correct 5 ms 3420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15964 KB Output is correct
2 Correct 26 ms 10324 KB Output is correct
3 Correct 142 ms 59640 KB Output is correct
4 Correct 46 ms 25756 KB Output is correct
5 Correct 114 ms 42932 KB Output is correct
6 Correct 403 ms 94184 KB Output is correct
7 Correct 7 ms 16472 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 1368 KB Output is correct
13 Correct 27 ms 10272 KB Output is correct
14 Correct 16 ms 7000 KB Output is correct
15 Correct 11 ms 9308 KB Output is correct
16 Correct 13 ms 4460 KB Output is correct
17 Correct 71 ms 21368 KB Output is correct
18 Correct 51 ms 28240 KB Output is correct
19 Correct 43 ms 25752 KB Output is correct
20 Correct 36 ms 19036 KB Output is correct
21 Correct 98 ms 41552 KB Output is correct
22 Correct 111 ms 42836 KB Output is correct
23 Correct 133 ms 34736 KB Output is correct
24 Correct 90 ms 38684 KB Output is correct
25 Correct 282 ms 80768 KB Output is correct
26 Correct 262 ms 118764 KB Output is correct
27 Correct 299 ms 107456 KB Output is correct
28 Correct 395 ms 94184 KB Output is correct
29 Correct 418 ms 93108 KB Output is correct
30 Correct 372 ms 97120 KB Output is correct
31 Correct 322 ms 62176 KB Output is correct
32 Correct 260 ms 92560 KB Output is correct