oj.uz

Submission #930213

# Submission time Handle Problem Language Result Execution time Memory
930213 2024-02-19T03:40:34 Z Amaarsaa Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 435 ms 130696 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 9 ms 3932 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 5 ms 3420 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 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 1628 KB Output is correct
12 Correct 3 ms 2140 KB Output is correct
13 Correct 2 ms 2184 KB Output is correct
14 Correct 2 ms 2136 KB Output is correct
15 Correct 7 ms 3676 KB Output is correct
16 Correct 10 ms 3928 KB Output is correct
17 Correct 7 ms 3672 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 15816 KB Output is correct
2 Correct 28 ms 11940 KB Output is correct
3 Correct 155 ms 75296 KB Output is correct
4 Correct 48 ms 29428 KB Output is correct
5 Correct 118 ms 51576 KB Output is correct
6 Correct 435 ms 109888 KB Output is correct
7 Correct 7 ms 16732 KB Output is correct
8 Correct 7 ms 16000 KB Output is correct
9 Correct 2 ms 856 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 8 ms 16220 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 28 ms 12044 KB Output is correct
14 Correct 16 ms 8020 KB Output is correct
15 Correct 12 ms 10332 KB Output is correct
16 Correct 13 ms 4952 KB Output is correct
17 Correct 70 ms 25328 KB Output is correct
18 Correct 53 ms 32116 KB Output is correct
19 Correct 45 ms 29532 KB Output is correct
20 Correct 38 ms 22388 KB Output is correct
21 Correct 91 ms 50528 KB Output is correct
22 Correct 115 ms 51660 KB Output is correct
23 Correct 150 ms 42336 KB Output is correct
24 Correct 97 ms 47616 KB Output is correct
25 Correct 295 ms 96392 KB Output is correct
26 Correct 231 ms 130696 KB Output is correct
27 Correct 318 ms 122984 KB Output is correct
28 Correct 399 ms 109860 KB Output is correct
29 Correct 394 ms 108440 KB Output is correct
30 Correct 367 ms 112448 KB Output is correct
31 Correct 347 ms 72200 KB Output is correct
32 Correct 266 ms 108240 KB Output is correct