oj.uz

Submission #660972

# Submission time Handle Problem Language Result Execution time Memory
660972 2022-11-23T18:50:08 Z ayushy78 Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 479 ms 130776 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 10 ms 3832 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 580 KB Output is correct
4 Correct 6 ms 3388 KB Output is correct
5 Correct 3 ms 2000 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 6 ms 2140 KB Output is correct
13 Correct 3 ms 2004 KB Output is correct
14 Correct 3 ms 2004 KB Output is correct
15 Correct 11 ms 3660 KB Output is correct
16 Correct 12 ms 3824 KB Output is correct
17 Correct 10 ms 3660 KB Output is correct
18 Correct 6 ms 3412 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15824 KB Output is correct
2 Correct 35 ms 11828 KB Output is correct
3 Correct 175 ms 75312 KB Output is correct
4 Correct 57 ms 29360 KB Output is correct
5 Correct 130 ms 51692 KB Output is correct
6 Correct 479 ms 110012 KB Output is correct
7 Correct 10 ms 16596 KB Output is correct
8 Correct 10 ms 15864 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 10 ms 16292 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 32 ms 11848 KB Output is correct
14 Correct 18 ms 7884 KB Output is correct
15 Correct 15 ms 10324 KB Output is correct
16 Correct 16 ms 4940 KB Output is correct
17 Correct 83 ms 25204 KB Output is correct
18 Correct 62 ms 32084 KB Output is correct
19 Correct 57 ms 29360 KB Output is correct
20 Correct 42 ms 22468 KB Output is correct
21 Correct 101 ms 50548 KB Output is correct
22 Correct 127 ms 51644 KB Output is correct
23 Correct 154 ms 42288 KB Output is correct
24 Correct 99 ms 47592 KB Output is correct
25 Correct 294 ms 96304 KB Output is correct
26 Correct 294 ms 130776 KB Output is correct
27 Correct 405 ms 123112 KB Output is correct
28 Correct 468 ms 109896 KB Output is correct
29 Correct 474 ms 108380 KB Output is correct
30 Correct 437 ms 112372 KB Output is correct
31 Correct 399 ms 72092 KB Output is correct
32 Correct 339 ms 108304 KB Output is correct