oj.uz

Submission #1061982

# Submission time Handle Problem Language Result Execution time Memory
1061982 2024-08-16T16:16:36 Z sikai004 Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 369 ms 118876 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;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3676 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 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 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 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 3 ms 2140 KB Output is correct
13 Correct 2 ms 1880 KB Output is correct
14 Correct 2 ms 2040 KB Output is correct
15 Correct 6 ms 3420 KB Output is correct
16 Correct 12 ms 3632 KB Output is correct
17 Correct 6 ms 3416 KB Output is correct
18 Correct 4 ms 3416 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15964 KB Output is correct
2 Correct 24 ms 10416 KB Output is correct
3 Correct 127 ms 59644 KB Output is correct
4 Correct 44 ms 25684 KB Output is correct
5 Correct 109 ms 42832 KB Output is correct
6 Correct 361 ms 94200 KB Output is correct
7 Correct 7 ms 16472 KB Output is correct
8 Correct 6 ms 15964 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 6 ms 16228 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 24 ms 10356 KB Output is correct
14 Correct 14 ms 7064 KB Output is correct
15 Correct 11 ms 9360 KB Output is correct
16 Correct 12 ms 4440 KB Output is correct
17 Correct 63 ms 21200 KB Output is correct
18 Correct 42 ms 28240 KB Output is correct
19 Correct 46 ms 25760 KB Output is correct
20 Correct 33 ms 19212 KB Output is correct
21 Correct 78 ms 41556 KB Output is correct
22 Correct 109 ms 42832 KB Output is correct
23 Correct 122 ms 34812 KB Output is correct
24 Correct 83 ms 38740 KB Output is correct
25 Correct 176 ms 80724 KB Output is correct
26 Correct 202 ms 118876 KB Output is correct
27 Correct 265 ms 107272 KB Output is correct
28 Correct 369 ms 94188 KB Output is correct
29 Correct 361 ms 92616 KB Output is correct
30 Correct 313 ms 96984 KB Output is correct
31 Correct 300 ms 62036 KB Output is correct
32 Correct 227 ms 92560 KB Output is correct