oj.uz

Submission #817160

# Submission time Handle Problem Language Result Execution time Memory
817160 2023-08-09T09:58:12 Z Dyzio96 Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 447 ms 118692 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 3540 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 5 ms 3336 KB Output is correct
5 Correct 3 ms 1876 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 1620 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 8 ms 3376 KB Output is correct
16 Correct 9 ms 3540 KB Output is correct
17 Correct 6 ms 3408 KB Output is correct
18 Correct 5 ms 3284 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15780 KB Output is correct
2 Correct 29 ms 10252 KB Output is correct
3 Correct 151 ms 59688 KB Output is correct
4 Correct 44 ms 25596 KB Output is correct
5 Correct 135 ms 42784 KB Output is correct
6 Correct 405 ms 94204 KB Output is correct
7 Correct 9 ms 16468 KB Output is correct
8 Correct 9 ms 15724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 9 ms 16232 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 28 ms 10260 KB Output is correct
14 Correct 16 ms 6996 KB Output is correct
15 Correct 13 ms 9300 KB Output is correct
16 Correct 14 ms 4332 KB Output is correct
17 Correct 71 ms 21304 KB Output is correct
18 Correct 53 ms 28208 KB Output is correct
19 Correct 51 ms 25676 KB Output is correct
20 Correct 41 ms 19000 KB Output is correct
21 Correct 93 ms 41340 KB Output is correct
22 Correct 114 ms 42768 KB Output is correct
23 Correct 143 ms 34588 KB Output is correct
24 Correct 88 ms 38604 KB Output is correct
25 Correct 286 ms 80708 KB Output is correct
26 Correct 238 ms 118692 KB Output is correct
27 Correct 315 ms 107312 KB Output is correct
28 Correct 447 ms 94372 KB Output is correct
29 Correct 404 ms 92696 KB Output is correct
30 Correct 366 ms 96932 KB Output is correct
31 Correct 336 ms 62024 KB Output is correct
32 Correct 314 ms 92532 KB Output is correct