## Submission #490094

# Submission time Handle Problem Language Result Execution time Memory
490094 2021-11-25T14:14:53 Z keertan Tracks in the Snow (BOI13_tracks) C++17
100 / 100
485 ms 118684 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 3532 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 6 ms 3276 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 588 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 2 ms 1612 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 4 ms 2012 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 3 ms 1868 KB Output is correct
15 Correct 10 ms 3352 KB Output is correct
16 Correct 10 ms 3652 KB Output is correct
17 Correct 8 ms 3424 KB Output is correct
18 Correct 6 ms 3276 KB Output is correct

#### Subtask #2 70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15832 KB Output is correct
2 Correct 32 ms 10356 KB Output is correct
3 Correct 162 ms 59724 KB Output is correct
4 Correct 54 ms 25588 KB Output is correct
5 Correct 127 ms 42824 KB Output is correct
6 Correct 484 ms 94120 KB Output is correct
7 Correct 10 ms 16460 KB Output is correct
8 Correct 10 ms 15820 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 10 ms 16204 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 32 ms 10364 KB Output is correct
14 Correct 18 ms 7012 KB Output is correct
15 Correct 15 ms 9332 KB Output is correct
16 Correct 16 ms 4300 KB Output is correct
17 Correct 84 ms 21224 KB Output is correct
18 Correct 63 ms 28188 KB Output is correct
19 Correct 52 ms 25668 KB Output is correct
20 Correct 41 ms 19052 KB Output is correct
21 Correct 99 ms 41440 KB Output is correct
22 Correct 124 ms 42820 KB Output is correct
23 Correct 157 ms 34568 KB Output is correct
24 Correct 101 ms 38752 KB Output is correct
25 Correct 297 ms 80588 KB Output is correct
26 Correct 288 ms 118684 KB Output is correct
27 Correct 381 ms 107288 KB Output is correct
28 Correct 485 ms 94244 KB Output is correct
29 Correct 481 ms 92624 KB Output is correct
30 Correct 442 ms 97036 KB Output is correct
31 Correct 392 ms 62040 KB Output is correct
32 Correct 334 ms 92636 KB Output is correct