Submission #896763

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
896763	2024-01-02T05:44:18 Z	artixkrishna	Tracks in the Snow (BOI13_tracks)	C++14	100 / 100	419 ms	118880 KB

tracks

#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;
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	3672 KB	Output is correct
2	Correct	0 ms	856 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	4 ms	3420 KB	Output is correct
5	Correct	2 ms	1884 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	1 ms	856 KB	Output is correct
9	Correct	1 ms	860 KB	Output is correct
10	Correct	2 ms	1628 KB	Output is correct
11	Correct	1 ms	1628 KB	Output is correct
12	Correct	4 ms	2140 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	3416 KB	Output is correct
16	Correct	10 ms	3676 KB	Output is correct
17	Correct	6 ms	3584 KB	Output is correct
18	Correct	5 ms	3420 KB	Output is correct

Subtask #2

70.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	15960 KB	Output is correct
2	Correct	27 ms	10324 KB	Output is correct
3	Correct	149 ms	59732 KB	Output is correct
4	Correct	46 ms	25680 KB	Output is correct
5	Correct	113 ms	42832 KB	Output is correct
6	Correct	419 ms	94332 KB	Output is correct
7	Correct	10 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	16216 KB	Output is correct
12	Correct	1 ms	1116 KB	Output is correct
13	Correct	26 ms	10328 KB	Output is correct
14	Correct	16 ms	7004 KB	Output is correct
15	Correct	12 ms	9308 KB	Output is correct
16	Correct	14 ms	4448 KB	Output is correct
17	Correct	71 ms	21244 KB	Output is correct
18	Correct	51 ms	28244 KB	Output is correct
19	Correct	44 ms	25680 KB	Output is correct
20	Correct	38 ms	19096 KB	Output is correct
21	Correct	90 ms	41544 KB	Output is correct
22	Correct	112 ms	42832 KB	Output is correct
23	Correct	137 ms	34768 KB	Output is correct
24	Correct	87 ms	38740 KB	Output is correct
25	Correct	298 ms	80980 KB	Output is correct
26	Correct	231 ms	118880 KB	Output is correct
27	Correct	306 ms	107512 KB	Output is correct
28	Correct	405 ms	94364 KB	Output is correct
29	Correct	409 ms	92612 KB	Output is correct
30	Correct	358 ms	97016 KB	Output is correct
31	Correct	339 ms	62196 KB	Output is correct
32	Correct	275 ms	92556 KB	Output is correct