# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389903 | null_awe | Tracks in the Snow (BOI13_tracks) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<int>> field(h, vector<int>(w, 0)), rank(h, vector<int>(w, -1));
for (int i = 0; i < h; ++i) {
string line;
cin >> line;
for (int j = 0; j < w; ++j) field[i][j] = (line[j] == '.' ? -1 : (line[j] == 'R' ? 1 : 2));
}
int m = 1;
rank[0][0] = 1;
queue<vector<int>> q;
vector<int> first{0, 0};
next.push_back(first);
while (!next.empty()) {
vector<int> s = q.front();
q.pop();
for (int i = 0; i < 4; ++i) {
int x = s[0] + dx[i], y = s[1] + dy[i];
if (x < 0 || y < 0 || x >= h || y >= w) continue;
if (rank[x][y] > 0 || field[x][y] < 0) continue;
rank[x][y] = rank[s[0]][s[1]] + (field[s[0]][s[1]] == field[x][y] ? 0 : 1);
vector<int> add{x, y};
q.push(add);
m = max(m, rank[x][y]);
}
}
cout << m;
return 0;
}