Submission #675799

# Submission time Handle Problem Language Result Execution time Memory
675799 2022-12-27T22:50:22 Z aaggupta07 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
510 ms 118736 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 12 ms 3540 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 6 ms 3328 KB Output is correct
5 Correct 3 ms 1876 KB Output is correct
6 Correct 0 ms 416 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 1620 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 4 ms 2052 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 12 ms 3444 KB Output is correct
16 Correct 10 ms 3560 KB Output is correct
17 Correct 9 ms 3388 KB Output is correct
18 Correct 6 ms 3284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 15844 KB Output is correct
2 Correct 41 ms 10268 KB Output is correct
3 Correct 157 ms 59700 KB Output is correct
4 Correct 53 ms 25672 KB Output is correct
5 Correct 123 ms 42832 KB Output is correct
6 Correct 509 ms 94260 KB Output is correct
7 Correct 11 ms 16468 KB Output is correct
8 Correct 10 ms 15828 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 9 ms 16212 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 31 ms 10308 KB Output is correct
14 Correct 19 ms 6996 KB Output is correct
15 Correct 15 ms 9280 KB Output is correct
16 Correct 15 ms 4308 KB Output is correct
17 Correct 83 ms 21220 KB Output is correct
18 Correct 62 ms 28156 KB Output is correct
19 Correct 56 ms 25692 KB Output is correct
20 Correct 44 ms 19020 KB Output is correct
21 Correct 105 ms 41448 KB Output is correct
22 Correct 127 ms 42840 KB Output is correct
23 Correct 178 ms 34580 KB Output is correct
24 Correct 101 ms 38632 KB Output is correct
25 Correct 294 ms 80736 KB Output is correct
26 Correct 286 ms 118736 KB Output is correct
27 Correct 403 ms 107308 KB Output is correct
28 Correct 467 ms 94320 KB Output is correct
29 Correct 510 ms 92796 KB Output is correct
30 Correct 438 ms 96948 KB Output is correct
31 Correct 393 ms 62016 KB Output is correct
32 Correct 337 ms 92588 KB Output is correct