oj.uz

Submission #1040789

# Submission time Handle Problem Language Result Execution time Memory
1040789 2024-08-01T09:22:36 Z GuessWhoHas2Cats Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 343 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 11 ms 3672 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 3 ms 3420 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 3 ms 2140 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 5 ms 3520 KB Output is correct
16 Correct 7 ms 3676 KB Output is correct
17 Correct 5 ms 3420 KB Output is correct
18 Correct 3 ms 3420 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 19 ms 10304 KB Output is correct
3 Correct 108 ms 59744 KB Output is correct
4 Correct 37 ms 25632 KB Output is correct
5 Correct 97 ms 42832 KB Output is correct
6 Correct 343 ms 94132 KB Output is correct
7 Correct 6 ms 16472 KB Output is correct
8 Correct 5 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 5 ms 16220 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 21 ms 10376 KB Output is correct
14 Correct 11 ms 7004 KB Output is correct
15 Correct 10 ms 9308 KB Output is correct
16 Correct 10 ms 4444 KB Output is correct
17 Correct 51 ms 21332 KB Output is correct
18 Correct 36 ms 28244 KB Output is correct
19 Correct 33 ms 25676 KB Output is correct
20 Correct 27 ms 19036 KB Output is correct
21 Correct 71 ms 41552 KB Output is correct
22 Correct 91 ms 42840 KB Output is correct
23 Correct 103 ms 34752 KB Output is correct
24 Correct 66 ms 38644 KB Output is correct
25 Correct 151 ms 80620 KB Output is correct
26 Correct 175 ms 118876 KB Output is correct
27 Correct 229 ms 107268 KB Output is correct
28 Correct 337 ms 94184 KB Output is correct
29 Correct 339 ms 92820 KB Output is correct
30 Correct 328 ms 96876 KB Output is correct
31 Correct 285 ms 61956 KB Output is correct
32 Correct 216 ms 92560 KB Output is correct