Submission #533141

# Submission time Handle Problem Language Result Execution time Memory
533141 2022-03-05T01:02:59 Z iamvaruag Tracks in the Snow (BOI13_tracks) C++17
100 / 100
571 ms 127372 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 10 ms 3788 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 6 ms 3404 KB Output is correct
5 Correct 3 ms 1996 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 3 ms 1608 KB Output is correct
11 Correct 3 ms 1484 KB Output is correct
12 Correct 5 ms 2124 KB Output is correct
13 Correct 3 ms 1996 KB Output is correct
14 Correct 4 ms 1992 KB Output is correct
15 Correct 9 ms 3644 KB Output is correct
16 Correct 10 ms 3804 KB Output is correct
17 Correct 8 ms 3660 KB Output is correct
18 Correct 6 ms 3404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 15820 KB Output is correct
2 Correct 35 ms 11844 KB Output is correct
3 Correct 166 ms 61660 KB Output is correct
4 Correct 62 ms 27460 KB Output is correct
5 Correct 168 ms 44584 KB Output is correct
6 Correct 511 ms 96080 KB Output is correct
7 Correct 11 ms 16588 KB Output is correct
8 Correct 13 ms 15892 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 10 ms 16304 KB Output is correct
12 Correct 2 ms 1100 KB Output is correct
13 Correct 35 ms 11792 KB Output is correct
14 Correct 21 ms 7956 KB Output is correct
15 Correct 20 ms 10308 KB Output is correct
16 Correct 17 ms 4944 KB Output is correct
17 Correct 89 ms 22992 KB Output is correct
18 Correct 87 ms 29976 KB Output is correct
19 Correct 62 ms 27504 KB Output is correct
20 Correct 44 ms 20896 KB Output is correct
21 Correct 107 ms 43220 KB Output is correct
22 Correct 163 ms 44640 KB Output is correct
23 Correct 160 ms 36472 KB Output is correct
24 Correct 114 ms 40408 KB Output is correct
25 Correct 348 ms 82512 KB Output is correct
26 Correct 324 ms 127372 KB Output is correct
27 Correct 395 ms 107376 KB Output is correct
28 Correct 571 ms 94464 KB Output is correct
29 Correct 521 ms 92660 KB Output is correct
30 Correct 533 ms 97108 KB Output is correct
31 Correct 419 ms 61948 KB Output is correct
32 Correct 374 ms 92668 KB Output is correct