oj.uz

Submission #1004835

# Submission time Handle Problem Language Result Execution time Memory
1004835 2024-06-21T18:27:01 Z Braabebo10 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 391 ms 130796 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 8 ms 3784 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 3532 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 0 ms 652 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 3 ms 2140 KB Output is correct
13 Correct 2 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 7 ms 3672 KB Output is correct
16 Correct 8 ms 3932 KB Output is correct
17 Correct 6 ms 3700 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 6 ms 15964 KB Output is correct
2 Correct 26 ms 11860 KB Output is correct
3 Correct 137 ms 75528 KB Output is correct
4 Correct 45 ms 29520 KB Output is correct
5 Correct 109 ms 51796 KB Output is correct
6 Correct 391 ms 94440 KB Output is correct
7 Correct 7 ms 16732 KB Output is correct
8 Correct 6 ms 15912 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 16216 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 24 ms 11868 KB Output is correct
14 Correct 14 ms 7908 KB Output is correct
15 Correct 11 ms 10332 KB Output is correct
16 Correct 13 ms 4956 KB Output is correct
17 Correct 65 ms 25296 KB Output is correct
18 Correct 42 ms 32076 KB Output is correct
19 Correct 51 ms 29520 KB Output is correct
20 Correct 34 ms 22608 KB Output is correct
21 Correct 83 ms 50704 KB Output is correct
22 Correct 105 ms 51772 KB Output is correct
23 Correct 113 ms 42192 KB Output is correct
24 Correct 78 ms 47700 KB Output is correct
25 Correct 185 ms 96596 KB Output is correct
26 Correct 194 ms 130796 KB Output is correct
27 Correct 303 ms 119312 KB Output is correct
28 Correct 350 ms 110052 KB Output is correct
29 Correct 358 ms 108456 KB Output is correct
30 Correct 313 ms 112348 KB Output is correct
31 Correct 296 ms 72144 KB Output is correct
32 Correct 218 ms 108340 KB Output is correct